Linearity is polynomially decidable for realtime pushdown store automata
From MaRDI portal
Publication:3048299
DOI10.1016/S0019-9958(79)90134-7zbMath0413.68086MaRDI QIDQ3048299
Publication date: 1979
Published in: Information and Control (Search for Journal in Brave)
Related Items (7)
The interchange or pump (di)lemmas for context-free languages ⋮ Ogden's lemma for nonterminal bounded languages ⋮ On bounded languages and reversal-bounded automata ⋮ On equivalence and subclass containment problems for deterministic context-free languages ⋮ Comparisons between some pumping conditions for context-free languages ⋮ New families of non real time dpda's and their decidability results ⋮ Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
This page was built for publication: Linearity is polynomially decidable for realtime pushdown store automata