On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems (Q1594479): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:28, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems |
scientific article |
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
