The following pages link to (Q4371017):
Displaying 6 items.
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Random context structure grammars and automata - a formal approach (Q2638788) (← links)
- A uniform framework for problems on context-free grammars (Q2729233) (← links)