Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (Q3167503)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata |
scientific article |
Statements
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (English)
0 references
2 November 2012
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
