Author of the publication

Single-Valuedness of Tree Transducers is Decidable in Polynomial Time.

. Theor. Comput. Sci., 106 (1): 135-181 (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Macro forest transducers., and . Inf. Process. Lett., 89 (3): 141-149 (2004)Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable., , and . J. ACM, 65 (4): 21:1-21:30 (2018)Numerical Invariants through Convex Relaxation and Max-Strategy Iteration, and . CoRR, (2012)Infinite-state high-level MSCs: Model-checking and realizability., , , and . J. Comput. Syst. Sci., 72 (4): 617-647 (2006)Abstract interpretation meets convex optimization., , , , and . J. Symb. Comput., 47 (12): 1416-1446 (2012)Single-Valuedness of Tree Transducers is Decidable in Polynomial Time.. Theor. Comput. Sci., 106 (1): 135-181 (1992)Fast and Simple Nested Fixpoints. Universität Trier, Mathematik/Informatik, Forschungsbericht, (1996)Interprocedural Analysis Based on PDAs, and . Universität Trier, Mathematik/Informatik, Forschungsbericht, (1997)When Is a Functional Tree Transduction Deterministic?. TAPSOFT, volume 668 of Lecture Notes in Computer Science, page 251-265. Springer, (1993)Least Solutions of Equations over N.. ICALP, volume 820 of Lecture Notes in Computer Science, page 400-411. Springer, (1994)