THE CLASS OF ALL REGULAR EQUIVALENCES: ALGEBRAIC STRUCTURE AND COMPUTATION t
نویسندگان
چکیده
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983) proving that it forms a lattice, and suggest a general approach to computing certain elements of the lattice. The resulting algorithm represents a useful complement to the White and Reitz algorithm, which can only find the maximal regular equivalence of a graph. Using this algorithm, it is possible to compute several well-known equivalences, such as structural equivalence (Lorrain and White 1971), automorphic equivalence (Everett and Borgatti 1988) and Winship-Pattison equivalence (Winship and Mandel 1983). In addition, any number of other useful equivalences may be generated, providing suitable mathematical descriptions of them are available.
منابع مشابه
Seminearring Models of Reversible Computation I Institutsbericht 533
Process Algebra is one of the well{known algebraic models used in theoretical Computer Science, mappings of semigroups are another such model. Both are based upon an algebraic structure known as a seminearring. Reversible Computation is a paradigm of growing importance, adaptions to current tools are of interest in the light of new developments. The extra structure aaorded to the algebraic stru...
متن کاملAlgebraic structure of flows of a regular coloured net
This paper introduces a new flow calculation theory for a wide subclass of coloured nets : the regular nets (R.N.). Their parametrization allows to study at the same time the flows for all nets differing only by the sizes of the colour sets. The algebraic structure of the flows subspace provides a fundamental decomposition theorem leading to an algorithm computing a flow basis for a parametrize...
متن کاملHomology of Higher Dimensional Automata
Higher dimensional automata can model concurrent computations. The topological structure of the higher dimensional automata determines certain properties of the concurrent computation. We introduce bi-complexes as an algebraic tool for describing these automata and develop a simple homology theory for higher dimensional automata. We then show how the homology of automata has applications in the...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملAn algebraic construction of orthonormal M-band wavelets with perfect reconstruction
This paper presents an algebraic approach to construct M-band orthonormal wavelet bases with perfect reconstruction. We first derive the system of constraint equations of M-band filter banks, and then an algebraic solution based on matrix decomposition is developed. The structure of the solutions is presented, and practical construction procedures are given. By using this algebraic approach, so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002