✦ 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
DOI: 10.1007/s00224-009-9224-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted Picture Automata and Weighted L

Weighted Picture Automata and Weighted Logics

✍ Ina Fichtner 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 735 KB

A Kleene Theorem for Weighted Tree Autom

A Kleene Theorem for Weighted Tree Automata

✍ Manfred Droste; Christian Pech; Heiko Vogler 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 418 KB

XML schema, tree logic and sheaves autom

XML schema, tree logic and sheaves automata

✍ Silvano Dal Zilio; Denis Lugiez 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 490 KB

A Kleene Theorem for Weighted Tree Autom

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids

✍ Zoltán Fülöp; Andreas Maletti; Heiko Vogler 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 751 KB

Timed tree automata with an application

Timed tree automata with an application to temporal logic

✍ Salvatore La Torre; Margherita Napoli 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 210 KB

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