Pages that link to "Item:Q1944895"
From MaRDI portal
The following pages link to P-hardness of the emptiness problem for visibly pushdown languages (Q1944895):
Displaying 5 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- On the Membership Problem for Visibly Pushdown Languages (Q3522902) (← links)
- Digging input-driven pushdown automata (Q5021110) (← links)
- (Q5377226) (← links)