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

DOI10.1515/DMA.2010.020zbMATH Open1221.03032OpenAlexW1994076373MaRDI QIDQ3585192FDOQ3585192

Publication date: 19 August 2010

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2010.020

Recommendations

On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
Finiteness of the set of automaton Post bases with solvable completeness problem
On decidability of the completeness problem for special systems of automaton functions
On the completeness of systems of finite automata

decidability Boolean functions undecidability halting problem definite automata \(A\)-completeness problem Post productions

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Thue and Post systems, etc. (03D03)

Cited In (7)

This page was built for publication: On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585192)