Article
Licensed
Unlicensed
Requires Authentication
On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
-
D. N. Zhuk
Published/Copyright:
July 8, 2010
Abstract
We consider systems of the form M = F ∪ ν, where F is some Post class and ν is a finite system of definite automata. We divide the Post classes into those for which the problem of A-completeness of such systems of definite automata is algorithmically decidable and those for which the problem of A-completeness is algorithmically undecidable.
Received: 2010-02-03
Published Online: 2010-07-08
Published in Print: 2010-July
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- A limit theorem for the logarithm of the order of a random A-permutation
- On game-theoretic characterisation of stochastic independence
- On the potential divisibility of matrices over distributive lattices
- On learning monotone Boolean functions with irrelevant variables
- Barriers of perfectly balanced Boolean functions
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
Articles in the same Issue
- A limit theorem for the logarithm of the order of a random A-permutation
- On game-theoretic characterisation of stochastic independence
- On the potential divisibility of matrices over distributive lattices
- On learning monotone Boolean functions with irrelevant variables
- Barriers of perfectly balanced Boolean functions
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
