Decomposition of automata and enriched category theory
S. Kasangian, R. Rosebrugh (1986)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Displaying similar documents to “On classification, logical educational materials, categories, and automata”
Decomposition of automata and enriched category theory
Functorial concepts of complexity for finite automata.
Lawvere, F.William (2004)
Theory and Applications of Categories [electronic only]
Similarity:
Systems of parallel communicating restarting automata
Marcel Vollweiler, Friedrich Otto (2014)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Several types of systems of parallel communicating restarting automata are introduced and studied. The main result shows that, for all types of restarting automata X, centralized systems of restarting automata of type X have the same computational power as non-centralized systems of restarting automata of the same type and the same number of components. This result is proved by a direct simulation. In addition, it is shown that for one-way restarting automata without auxiliary symbols,...
Generalized grammatical categories in the sense of Kunze
Blažej Kříž (1981)
Archivum Mathematicum
Similarity:
Returning and non-returning parallel communicating finite automata are equivalent
Ashish Choudhary, Kamala Krithivasan, Victor Mitrana (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
A parallel communicating automata system consists of several automata working independently in parallel and communicating with each other by request with the aim of recognizing a word. Rather surprisingly, returning parallel communicating finite automata systems are equivalent to the non-returning variants. We show this result by proving the equivalence of both with multihead finite automata. Some open problems are finally formulated.