✦ LIBER ✦

Inference of tree automata from sample set of trees

✍ Scribed by H. Fukuda; K. Kamata

Publisher: Springer
Year: 1984
Tongue: English
Weight: 542 KB
Volume: 13
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf00979871

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inference of tree grammars using negativ

Inference of tree grammars using negative samples

✍ Alejandro Barrero 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 608 KB

On trees and tree dimension of ordered s

On trees and tree dimension of ordered sets

✍ Gerhard Behrendt 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 501 KB

Deciding low levels of tree-automata hie

Deciding low levels of tree-automata hierarchy

✍ Igor Walukiewicz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 942 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

Tree of Ages Box Set

✍ Sara C Roethle 📂 Fiction 📅 2019 🏛 Vulture's Eye Publications 🌐 English ⚖ 551 KB 👁 3 views

Yield-languages of two-way pushdown tree

Yield-languages of two-way pushdown tree automata

✍ Kai Salomaa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 476 KB