✦ LIBER ✦

The Universality of Higher-Order Attributed Tree Transducers

✍ Scribed by T. Noll; H. Vogler

Publisher: Springer
Year: 2000
Tongue: English
Weight: 288 KB
Volume: 34
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002240010018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Characterization of Attributed Tree Tr

A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers

✍ Z. Fülöp; H. Vogler 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 198 KB

The time complexity of typechecking tree

The time complexity of typechecking tree-walking tree transducers

✍ Joost Engelfriet 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 222 KB

Almost-homogeneity of the universe in hi

Almost-homogeneity of the universe in higher-order gravity

✍ David R. Taylor; Roy Maartens 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 541 KB

On higher order Weierstrass points of th

On higher order Weierstrass points of the universal curve

✍ Robert F. Lax 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 French ⚖ 308 KB

Higher order analysis of random 1–2 brot

Higher order analysis of random 1–2 brother trees

✍ Th. Ottmann; W. Stucky 📂 Article 📅 1980 🏛 Springer Netherlands 🌐 English ⚖ 752 KB

The suffix tree of a tree and minimizing

The suffix tree of a tree and minimizing sequential transducers

✍ Dany Breslauer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

This paper gives a linear-time algorithm for the construction of the suffix tree of a tree, which was introduced by Kosaraju, as a natural generalization of the suffix tree of a string. The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers.