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
Removed claim: author (P16): Item:Q785977 |
Changed an Item |
||
| Property / author | |||
| Property / author: Dmitriĭ Nikolaevich Babin / rank | |||
Normal rank | |||
Revision as of 05:09, 21 February 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
