The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825)

From MaRDI portal
Revision as of 03:38, 14 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The complexity of restricted regular expressions and the synthesis problem for finite automata
scientific article

    Statements

    The complexity of restricted regular expressions and the synthesis problem for finite automata (English)
    0 references
    1981
    0 references
    regular expression
    0 references
    deterministic finite automaton
    0 references
    0 references

    Identifiers