𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weighted Logics for Unranked Tree Automata

✍ Scribed by Manfred Droste; Heiko Vogler


Publisher
Springer
Year
2009
Tongue
English
Weight
649 KB
Volume
48
Category
Article
ISSN
1433-0490

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