On the Length of Shortest Strings Accepted by Two-way Finite Automata (Q5158651)

From MaRDI portal
Revision as of 09:32, 17 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7413805
Language Label Description Also known as
English
On the Length of Shortest Strings Accepted by Two-way Finite Automata
scientific article; zbMATH DE number 7413805

    Statements

    On the Length of Shortest Strings Accepted by Two-way Finite Automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 2021
    0 references
    0 references
    finite automata
    0 references
    two-way automata
    0 references
    state complexity
    0 references
    shortest string
    0 references