Polynomial complete problems in automata theory (Q1838038): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90067-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052581866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-entry finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3239817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank

Latest revision as of 18:29, 13 June 2024

scientific article
Language Label Description Also known as
English
Polynomial complete problems in automata theory
scientific article

    Statements

    Polynomial complete problems in automata theory (English)
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    deterministic finite state automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references