Pages that link to "Item:Q1944966"
From MaRDI portal
The following pages link to Parikh's theorem: a simple and direct automaton construction (Q1944966):
Displaying 14 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Bounded underapproximations (Q453533) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- Verifying quantitative temporal properties of procedural programs (Q5009429) (← links)
- (Q5015278) (← links)
- (Q5015369) (← links)
- The Parikh Property for Weighted Context-Free Grammars (Q5090971) (← links)
- A Proof of Parikh’s Theorem via Dickson’s Lemma (Q5859679) (← links)
- Further closure properties of input-driven pushdown automata (Q5919707) (← links)
