𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Language classes generated by tree controlled grammars with bounded nonterminal complexity

✍ Scribed by Sherzod Turaev; Jürgen Dassow; Florin Manea; Mohd Hasan Selamat

Book ID
116907344
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
250 KB
Volume
449
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Logical Complexity of Some Classes of Tr
Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata
✍ Wojciech Buszkowski 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 515 KB

LOGICAL COMPLEXITY O F SOME CLASSES O F TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA by WOJCIECH BUSZKOWSKI in Poznaii (Poland) 0. Introduction. Preliminary terminology and notation Multiple-tree-automata (MTAs) correspond to the kind of grammars called Lindenmayer systems with tables (cf. ROZ