Pages that link to "Item:Q2208249"
From MaRDI portal
The following pages link to Equivalence of pushdown automata via first-order grammars (Q2208249):
Displaying 8 items.
- The first order theory of primal grammars is decidable (Q1882903) (← links)
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence (Q2301358) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output (Q3617047) (← links)
- (Q4673421) (← links)
- Bisimulation Equivalence of First-Order Grammars (Q5167841) (← links)
- Two Grammatical Equivalents of Flip-Pushdown Automata (Q5175116) (← links)
- General-nondeterministic fuzzy pushdown automata and their languages (Q6535270) (← links)