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
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10958-010-9972-3 / rank
Normal rank
 
Property / author
 
Property / author: Dmitriĭ Nikolaevich Babin / rank
Normal rank
 
Property / author
 
Property / author: Dmitriĭ Nikolaevich Babin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
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
Property / DOI
 
Property / DOI: 10.1007/S10958-010-9972-3 / rank
 
Normal rank

Latest revision as of 17:49, 18 December 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

    Identifiers