A topology for automata. II.
Srivastava, Arun K., Shukla, Wagish (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “Autonomous automata and closures with the same endomorphism monoids”
A topology for automata. II.
Erasing automata recognize more than context-free languages
František Mráz, Martin Plátek (1995)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
Prolog infinite trees and automata
Solange Coupet-Grimal (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the product of all elements in a finite group.
Dömösi, Pál (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
The number of automata, boundedly determined functions and hereditary properties of automata
A. D. Koršunov (1976)
Kybernetika
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.