Tree acceptors and grammar forms

DOI10.1007/BF02254847zbMath0477.68088OpenAlexW150338661MaRDI QIDQ1160494

Seymour Ginsburg, O. Mayer

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02254847

zbMATH Keywords

context-free grammarderivation trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Derivation-bounded languages
• Tree acceptors and some of their applications
• On strict interpretations of grammar forms

This page was built for publication: Tree acceptors and grammar forms