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

From MaRDI portal
Revision as of 17:00, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Converting two-way nondeterministic unary automata into simpler automata.
scientific article

    Statements

    title
    Converting two-way nondeterministic unary automata into simpler automata. (English)
    0 references
    author
    Viliam Geffert
    0 references
    Carlo Mereghetti
    0 references
    Giovanni Pighizzini
    0 references
    publication date
    17 August 2003
    0 references
    zbMATH Keywords
    Formal languages
    0 references
    Finite state automata
    0 references
    Unary languages
    0 references

    Identifiers

    zbMATH DE Number
    1965273
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1401239&oldid=13558630"
    Powered by MediaWiki