A Grammatical Characterization of One-Way Nondeterministic Stack Languages

DOI10.1145/321637.321639MaRDI QIDQ5183104zbMATH OpenOpenAlexFDO

Authors Michael A. Harrison, Mario Schkolnick

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

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

Cited in

(8)

• Theory of formal grammars
• On AFL generators for finitely encoded AFA
• Normal forms for phrase-structure grammars
• scientific article; zbMATH DE number 3548457 (Why is no real title available?)
• Tree-stack automata
• On the structure of context-sensitive grammars
• Visit-bounded stack automata
• Deterministic tree-walking-storage automata

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

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