On the equivalence of the cube-product and the general product of automata

In this work it is shown that the general product is equivalent to the cube-product with respect to the isomorphic representation. Using this equivalence we characterize the homomorphically complete systems of automata with respect to the cube-product. Furthermore, several earlier results and new re...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 245; no. 1; pp. 103 - 113
Main Author Imreh, B.
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 17.08.2000
Elsevier
Subjects
Applied sciences
Automata
Automata. Abstract machines. Turing machines
Complete Systems
Composition
Computer science; control theory; systems
Exact sciences and technology
Isomorphis representation
Language theory and syntactical analysis
Theoretical computing
Complete Systems
Composition
Isomorphis representation
Automata
Complete graph
Deterministic automaton
Complete automata system
Finite automaton
Graph theory
Homomorphism
Non deterministic automaton
Automaton product
Cube product
Isomorphic representation
Equivalence
Network
Isomorphism
Online AccessGet full text

Cover

More Information
Summary:In this work it is shown that the general product is equivalent to the cube-product with respect to the isomorphic representation. Using this equivalence we characterize the homomorphically complete systems of automata with respect to the cube-product. Furthermore, several earlier results and new results are concluded as consequences of this equivalence.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(99)00276-5