Finiteness of the set of automaton Post bases with solvable completeness problem (Q4522760)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1548576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finiteness of the set of automaton Post bases with solvable completeness problem |
scientific article; zbMATH DE number 1548576 |
Statements
Finiteness of the set of automaton Post bases with solvable completeness problem (English)
0 references
4 January 2001
0 references
Boolean functions
0 references
Post class
0 references
automaton functions
0 references
completeness problem
0 references
\(A\)-completeness problem
0 references
0.9199204444885254
0 references
0.8798091411590576
0 references
0.8769060373306274
0 references
0.8765709400177002
0 references
