The following pages link to (Q2908855):
Displayed 5 items.
- Equivalence of pushdown automata via first-order grammars (Q2208249) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)