The following pages link to (Q4028125):
Displaying 4 items.
- On the regular structure of prefix rewriting (Q685354) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- Complete SAT-Based Model Checking for Context-Free Processes (Q3510785) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
