On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata (Q2453381): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4272118 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3980812 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5557947 / rank | |||
Normal rank | |||
Revision as of 14:00, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata |
scientific article |
Statements
On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata (English)
0 references
6 June 2014
0 references
