Linearity is polynomially decidable for realtime pushdown store automata

DOI10.1016/S0019-9958(79)90134-7zbMATH Open0413.68086MaRDI QIDQ3048299FDOQ3048299

Authors: Sheila A. Greibach 

Publication date: 1979

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

acceptancepolynomial decidabilitylinear context free languagesreal-time pushdown store automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Cited In (7)

• Comparisons between some pumping conditions for context-free languages
• The interchange or pump (di)lemmas for context-free languages
• On bounded languages and reversal-bounded automata
• Ogden's lemma for nonterminal bounded 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
• On equivalence and subclass containment problems for deterministic context-free languages

This page was built for publication: Linearity is polynomially decidable for realtime pushdown store automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048299)