On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata (Q2453381)

From MaRDI portal
Revision as of 21:57, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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

    Identifiers