Pages that link to "Item:Q2904749"
From MaRDI portal
The following pages link to A pumping lemma for pushdown graphs of any level (Q2904749):
Displaying 8 items.
- A new pumping lemma for indexed languages, with an application to infinite words (Q729820) (← links)
- A pumping lemma and the structure of derivations in the boundary NLC graph languages (Q1328510) (← links)
- On 3-pushdown graphs with large separators (Q2277467) (← links)
- A pumping lemma for collapsible pushdown graphs of level 2 (Q2915692) (← links)
- Collapsible Pushdown Graphs of Level 2 are Tree-Automatic (Q3113775) (← links)
- An Approach to Computing Downward Closures (Q3449495) (← links)
- Collapsible Pushdown Graphs of Level 2 are Tree-Automatic (Q4913775) (← links)
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems (Q5090985) (← links)