### The number of automata, boundedly determined functions and hereditary properties of automata

A. D. Koršunov (1976)

Kybernetika

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

A. D. Koršunov (1976)

Kybernetika

Similarity:

R.H. Oehmke (1977/78)

Semigroup forum

Similarity:

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.

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,...

Srivastava, Arun K., Shukla, Wagish (1986)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Gerard Lallement (1989)

Semigroup forum

Similarity:

W. Forys (1984)

Semigroup forum

Similarity:

Boris M. Schein (1969)

Kybernetika

Similarity: