Pages that link to "Item:Q930285"
From MaRDI portal
The following pages link to An efficient automata approach to some problems on context-free grammars. (Q930285):
Displaying 5 items.
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- A uniform framework for problems on context-free grammars (Q2729233) (← links)
- (Q4371017) (← links)