Bounded nesting in macro grammars

DOI10.1016/S0019-9958(79)90635-1zbMath0453.68051OpenAlexW2015086500MaRDI QIDQ3901018

Giora Slutzki, Joost Engelfriet

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/s0019-9958(79)90635-1

zbMATH Keywords

context-free tree grammarsnesting-depth of nested calls of nonterminalspath-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The generative power of delegation networks, Iterated linear control and iterated one-turn pushdowns, The formal power of one-visit attribute grammars, Basic tree transducers, Time and space complexity of inside-out macro languages, Hierarchies of hyper-AFLs, Extended macro grammars and stack controlled machines, Macro tree transducers