Operational state complexity of unary NFAs with finite nondeterminism (Q896686)

From MaRDI portal
Revision as of 05:21, 11 July 2024 by ReferenceBot (talk | contribs) (โ€ŽChanged an Item)
(diff) โ† Older revision | Latest revision (diff) | Newer revision โ†’ (diff)
scientific article
Language Label Description Also known as
English
Operational state complexity of unary NFAs with finite nondeterminism
scientific article

    Statements

    Operational state complexity of unary NFAs with finite nondeterminism (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2015
    0 references
    0 references
    finite automata
    0 references
    limited nondeterminism
    0 references
    state complexity
    0 references
    language operations
    0 references
    unary regular languages
    0 references
    descriptional complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references