Article
Licensed
Unlicensed
Requires Authentication
Minimality and deadlockness of multitape automata
-
R. I. Podlovchenko
Published/Copyright:
July 9, 2008
Abstract
We consider the class M of deterministic binary two-tape automata for which those states of the automaton where reading from the additional second tape is implemented permit to continue the calculation only in the case where the read symbol is fixed in advance for all automata. For the automata of the class M, the so-called generalised minimisation problem is considered. This problem consists in finding all automata which are minimal in the number of states in any class of equivalent automata of M. In the paper, the decidability of the generalised minimisation problem in M is proved and a procedure to solve this problem is described and analysed.
Received: 2007-12-25
Published Online: 2008-07-09
Published in Print: 2008-June
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Testing numbers of the form for primality
- On the complexity of construction of complete and complete bipartite graphs
- Minimality and deadlockness of multitape automata
- Limit distributions of the number of absent chains of identical outcomes
- Parallel embeddings of octahedral polyhedra
Articles in the same Issue
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Testing numbers of the form for primality
- On the complexity of construction of complete and complete bipartite graphs
- Minimality and deadlockness of multitape automata
- Limit distributions of the number of absent chains of identical outcomes
- Parallel embeddings of octahedral polyhedra
