Pages that link to "Item:Q1193884"
From MaRDI portal
The following pages link to Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884):
Displaying 6 items.
- Linear time parsers for classes of non context free languages (Q671525) (← links)
- Parallel parsing of tree adjoining grammars on the connection machine (Q685085) (← links)
- An NC algorithm for recognizing tree adjoining languages (Q685232) (← links)
- A geometric hierarchy beyond context-free languages (Q1200806) (← links)
- DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS (Q3401481) (← links)
- Pumping lemmas for the control language hierarchy (Q4835863) (← links)
