Undecidability of the completeness and A-completeness problems for some systems of automaton functions (Q4857009)
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: Undecidability of the completeness and A-completeness problems for some systems of automaton functions |
scientific article; zbMATH DE number 823663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Undecidability of the completeness and A-completeness problems for some systems of automaton functions |
scientific article; zbMATH DE number 823663 |
Statements
Undecidability of the completeness and A-completeness problems for some systems of automaton functions (English)
0 references
15 January 1996
0 references
algorithmic undecidability
0 references
\(A\)-completeness problem
0 references
automaton function
0 references
completeness problem
0 references
0.9333804249763488
0 references
0.9333804249763488
0 references
0.8743458390235901
0 references
0.8725976943969727
0 references
