✦ LIBER ✦

Unranked tree languages

✍ Scribed by Alejandro Barrero

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 702 KB
Volume: 24
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(91)90112-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted Logics for Unranked Tree Automa

Weighted Logics for Unranked Tree Automata

✍ Manfred Droste; Heiko Vogler 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 649 KB

Ranking and unranking of B-trees

✍ U.I Gupta; D.T Lee; C.K Wong 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Unranking and ranking spanning trees of

Unranking and ranking spanning trees of a graph

✍ Charles J Colbourn; Robert P.J Day; Louis D Nel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 845 KB

Tree Adjoining Languages and Multipushdo

Tree Adjoining Languages and Multipushdown Languages

✍ A. Cherubini; P. San Pietro 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 382 KB

Tree grammars and languages

✍ A. S. Modina 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 779 KB

Ranking and unranking of non-regular tre

Ranking and unranking of non-regular trees with a prescribed branching sequence

✍ Ro-Yu Wu; Jou-Ming Chang; Chir-Ho Chang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Ordered trees are called non-regular trees with a prescribed branching sequence (or nonregular trees for short) if their internal nodes have a pre-specified degree sequence in preorder list. This article presents two main results. First, we develop a simple algorithm to generate all non-regular tree