Pages that link to "Item:Q4787831"
From MaRDI portal
The following pages link to A Fully Equational Proof of Parikh's Theorem (Q4787831):
Displaying 7 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Algebraically complete semirings and Greibach normal form (Q1772777) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Equational theories for automata (Q2074221) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- Newton’s Method for ω-Continuous Semirings (Q3520300) (← links)
- (Q3581793) (← links)