Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739)

From MaRDI portal
Revision as of 19:16, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Comparing the size of NFAs with and without \(\epsilon\)-transitions
scientific article

    Statements

    Comparing the size of NFAs with and without \(\epsilon\)-transitions (English)
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    0 references
    finite automata
    0 references
    descriptional complexity
    0 references
    lower bounds on complexity
    0 references