On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (Q1594479)
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 according to the decidability of the completeness and A-completeness problems |
scientific article; zbMATH DE number 1557776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems |
scientific article; zbMATH DE number 1557776 |
Statements
On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (English)
0 references
28 January 2001
0 references
decidable completeness problem
0 references
Post class
0 references
automaton functions
0 references
0.9456353187561036
0 references
0.9199204444885254
0 references
0.916203796863556
0 references
0.8646974563598633
0 references
