On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata (Q3585192)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata |
scientific article |
Statements
On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata (English)
0 references
19 August 2010
0 references
definite automata
0 references
Boolean functions
0 references
\(A\)-completeness problem
0 references
decidability
0 references
undecidability
0 references
halting problem
0 references
Post productions
0 references
