Converting two-way nondeterministic unary automata into simpler automata (Q4785462)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1848284
Language Label Description Also known as
default for all languages
No label defined
    English
    Converting two-way nondeterministic unary automata into simpler automata
    scientific article; zbMATH DE number 1848284

      Statements

      0 references
      0 references
      0 references
      25 February 2003
      0 references
      formal languages
      0 references
      finite state automata
      0 references
      unary languages
      0 references
      Converting two-way nondeterministic unary automata into simpler automata (English)
      0 references

      Identifiers