✦ LIBER ✦

Some results in tree automata

✍ Scribed by L. S. Levy; A. K. Joshi

Book ID: 105295014
Publisher: Springer
Year: 1972
Tongue: English
Weight: 577 KB
Volume: 6
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01740725

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some mathematical results for cellular a

Some mathematical results for cellular automata

✍ E. Ahmed; A.S. Elgazzar 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Completeness results concerning systolic

Completeness results concerning systolic tree automata and E0L languages

✍ Angelo Monti; Alessandro Roncato 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Some results on cascade decomposition of

Some results on cascade decomposition of automata

✍ B.G. Reynolds 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 680 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

Some results on spanning trees

✍ Bing Yao; Zhong-fu Zhang; Jian-fang Wang 📂 Article 📅 2010 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 211 KB

Some results on the decomposition of fin

Some results on the decomposition of finite automata

✍ Jerzy Tiuryn 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 438 KB