Tree adjoining languages and multipushdown languages

DOI10.1007/s002240010004zbMath0961.68075OpenAlexW2081149652WikidataQ127451765 ScholiaQ127451765MaRDI QIDQ1587367

Pierluigi San Pietro, A. Cherubini Spoletini

Publication date: 7 December 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

context-free grammers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Storage products and linear control of derivations

This page was built for publication: Tree adjoining languages and multipushdown languages