Pages that link to "Item:Q3048299"
From MaRDI portal
The following pages link to Linearity is polynomially decidable for realtime pushdown store automata (Q3048299):
Displayed 7 items.
- New families of non real time dpda's and their decidability results (Q799385) (← links)
- On bounded languages and reversal-bounded automata (Q899318) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- Ogden's lemma for nonterminal bounded languages (Q3768421) (← links)
- Comparisons between some pumping conditions for context-free languages (Q4729382) (← links)