Converting two-way nondeterministic unary automata into simpler automata. (Q1401239): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57380802, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57380802 / rank | |||
Normal rank | |||
Revision as of 00:30, 7 February 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
