Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter July 8, 2010

On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata

  • D. N. Zhuk

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

Downloaded on 25.4.2024 from https://www.degruyter.com/document/doi/10.1515/dma.2010.020/html
Scroll to top button