Converting two-way nondeterministic unary automata into simpler automata. (Q1401239)

From MaRDI portal
Revision as of 15:16, 20 July 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
Converting two-way nondeterministic unary automata into simpler automata.
scientific article

    Statements

    Converting two-way nondeterministic unary automata into simpler automata. (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    Formal languages
    0 references
    Finite state automata
    0 references
    Unary languages
    0 references

    Identifiers