A Grammatical Characterization of One-Way Nondeterministic Stack Languages

DOI10.1145/321637.321639zbMath0274.68020OpenAlexW1981137954MaRDI QIDQ5183104

Mario Schkolnick, Michael A. Harrison

Publication date: 1971

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321637.321639

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Turing machines and related notions (03D10)

Related Items (7)

Unnamed Item ⋮ Normal forms for phrase-structure grammars ⋮ Tree-stack automata ⋮ On the structure of context-sensitive grammars ⋮ Visit-bounded stack automata ⋮ On AFL generators for finitely encoded AFA ⋮ Theory of formal grammars

This page was built for publication: A Grammatical Characterization of One-Way Nondeterministic Stack Languages