Converting two-way nondeterministic unary automata into simpler automata. (Q1401239): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:00, 31 January 2024
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
17 August 2003
0 references
Formal languages
0 references
Finite state automata
0 references
Unary languages
0 references
