Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1212.1346 / rank | |||
Normal rank | |||
Revision as of 13:04, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata |
scientific article |
Statements
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (English)
0 references
19 December 2013
0 references
finite automaton
0 references
context-free grammar
0 references
Parikh's theorem
0 references
descriptional complexity
0 references
semilinear set
0 references
Parikh equivalence
0 references
