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 profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10958-010-9972-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083828733 / rank | |||
Normal rank | |||
Revision as of 21:57, 19 March 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
