✦ LIBER ✦

The time complexity of typechecking tree-walking tree transducers

✍ Scribed by Joost Engelfriet

Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 222 KB
Volume: 46
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s00236-008-0087-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

The Tree of Time

✍ Mariah Stone 📂 Fiction 📅 2019 🏛 Stone Publishing 🌐 English ⚖ 108 KB 👁 2 views

The complexity of the capacitated tree p

The complexity of the capacitated tree problem

✍ C. H. Papadimitriou 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 707 KB

The Universality of Higher-Order Attribu

The Universality of Higher-Order Attributed Tree Transducers

✍ T. Noll; H. Vogler 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 288 KB

On the complexity of tree embedding prob

On the complexity of tree embedding problems

✍ Shai Simonson; I.Hal Sudborough 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 534 KB

The decision-tree complexity of element

The decision-tree complexity of element distinctness

✍ Ravi B. Boppana 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 216 KB