On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata (Q3585192)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata |
scientific article; zbMATH DE number 5773264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata |
scientific article; zbMATH DE number 5773264 |
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
0.9456353187561036
0 references
0.874991238117218
0 references
0.8738283514976501
0 references
0.8687635660171509
0 references
0.8687635660171509
0 references
