✦ LIBER ✦

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

✍ Scribed by Z. Fülöp; H. Vogler

Publisher: Springer
Year: 1999
Tongue: English
Weight: 198 KB
Volume: 32
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002240000135

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A comparison of pebble tree transducers

A comparison of pebble tree transducers with macro tree transducers

✍ Joost Engelfriet; Sebastian Maneth 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 693 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.

A characterization of the average tree s

A characterization of the average tree solution for tree games

✍ Debasis Mishra; A. J. J. Talman 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 118 KB

A characterization of bivariegated trees

✍ A.R. Bednarek; E.L. Sanders 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 938 KB

A @mph ix biwwiepted PO itr vertca; Jiet c"8n be partitioned into two equal sets such that e&t WPWQ is od@tuxnt to me and only one vertex in the set not containing it. A tree with 2~ verlh & bivaticgatcd Of an," mly if the largest indcpcndcnt subset of the vertex set hw uxdind n. A constructive desc

A characterization of k-trees

✍ Ralf Fröberg 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 147 KB

The purpose of this note is to give a local criterion for a graph to be a k-tree. We show that a connected graph with the right number of edges is a k-tree if and only if the neighbourhood of each vertex is a (k -l)-tree.

A characterization of Büchi tree automat

A characterization of Büchi tree automata

✍ Jerzy Skurczyński 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

We show that a language of infinite binary trees is definable by a Σ 2 -formula of the monadic second order logic of two successors (with no additional symbols) iff it can be accepted by a Büchi automaton. The same result has been obtained by G. Lenzi, but our proof is simpler.