The complexity of concatenation on deterministic and alternating finite automata (Q5223613)

From MaRDI portal
Revision as of 10:01, 18 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7082325
Language Label Description Also known as
English
The complexity of concatenation on deterministic and alternating finite automata
scientific article; zbMATH DE number 7082325

    Statements

    The complexity of concatenation on deterministic and alternating finite automata (English)
    0 references
    0 references
    0 references
    18 July 2019
    0 references
    regular languages
    0 references
    finite automata
    0 references
    concatenation
    0 references
    state complexity
    0 references

    Identifiers