𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parametric random generation of deterministic tree automata

✍ Scribed by Pierre-Cyrille Héam; Cyril Nicaud; Sylvain Schmitz


Book ID
108281653
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
577 KB
Volume
411
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Logical Complexity of Some Classes of Tr
✍ 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