On the complexity of events recognizable in real time
Miloslav Nekvinda (1973)
Kybernetika
Similarity:
Displaying similar documents to “Nondeterminism is essential for reversal-bounded two-way multihead finite automata”
On the complexity of events recognizable in real time
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.
The number of automata, boundedly determined functions and hereditary properties of automata
A. D. Koršunov (1976)
Kybernetika
Similarity:
On the k-reversibility of finite automata.
Falucskai, János (2008)
Annales Mathematicae et Informaticae
Similarity:
Set-theoretical operations on -multiple languages
Jaroslav Král (1967)
Kybernetika
Similarity: