✦ LIBER ✦

Yield-languages of two-way pushdown tree automata

✍ Scribed by Kai Salomaa

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 476 KB
Volume: 58
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00048-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Notes on looping deterministic two-way p

Notes on looping deterministic two-way pushdown automata

✍ M. Ladermann; H. Petersen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 444 KB

On two-way tree automata

✍ Etsuro Moriya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 323 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

A kleene-like characterization of langua

A kleene-like characterization of languages accepted by systolic tree automata

✍ E. Fachini; A. Monti 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 686 KB

We present a Kleen-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA). This characterization uses union, intersection, restricted concatenation, restricted concatenation closure, and finite substitution closure. The restrictions we impose on the operat

On the multiplying ability of two-way au

On the multiplying ability of two-way automata

✍ J.R.H. Dempster 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 292 KB

It is shown that multiplication and square root extraction can be performed by the two-way automata of Kreider and Ritchie, thus answering questions raised by those authors. Square root extraction is straightforward (yielding an integer root and a remainder), but multiplication is achieved only by c

A characterization of two-way determinis

A characterization of two-way deterministic classes of languages

✍ A.V. Aho; J.D. Ullman 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 731 KB

It is shown that a class of languages is defined by a class of two-way deterministic balloon automata if and only if that class is closed under marked union, marked Kleene closure and the inverse mappings performed by deterministic GSMs that move two ways on the input. Hence, the context sensitive l