Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216)
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 6239473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata |
scientific article; zbMATH DE number 6239473 |
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
0 references
0.9626424312591552
0 references
0.8398094177246094
0 references
0.8305811882019043
0 references
0.7613292932510376
0 references
0.7592191100120544
0 references
