Pages that link to "Item:Q1241068"
From MaRDI portal
The following pages link to A simplified proof of Parikh's theorem (Q1241068):
Displaying 6 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- Hairpin completions and reductions: semilinearity properties (Q6095486) (← links)
- Commutative Lambek grammars (Q6190089) (← links)
