Converting two-way nondeterministic unary automata into simpler automata. (Q1401239)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Converting two-way nondeterministic unary automata into simpler automata. |
scientific article; zbMATH DE number 1965273
| 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 1965273 |
Statements
Converting two-way nondeterministic unary automata into simpler automata. (English)
0 references
17 August 2003
0 references
Formal languages
0 references
Finite state automata
0 references
Unary languages
0 references
0 references
0.8837287425994873
0 references
0.8604226112365723
0 references
0.8565933704376221
0 references
