| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Sebastian Maneth Sebastian Maneth, Thomas Perst , Helmut Seidl : Exact XML Type Checking in Polynomial Time. Universität Trier, Mathematik/Informatik, Forschungsbericht 06-04: (2006) Markus Lohrey , Sebastian Maneth: Tree Automata and XPath on Compressed Trees. CIAA 2005 : 225-237 Giorgio Busatto , Markus Lohrey , Sebastian Maneth: Efficient Memory Representation of XML Documents. DBPL 2005 : 199-216 Joost Engelfriet , Sebastian Maneth: The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. FSTTCS 2005 : 495-504 Sebastian Maneth, Alexandru Berlea , Thomas Perst , Helmut Seidl : XML type checking with macro tree transducers. PODS 2005 : 283-294 Sebastian Maneth, Giorgio Busatto : Tree Transducers and Tree Compressions. FoSSaCS 2004 : 363-377 Sebastian Maneth: The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. FSTTCS 2003 : 326-337 Joost Engelfriet , Sebastian Maneth: A comparison of pebble tree transducers with macro tree transducers. Acta Inf. 39 (9): 613-698 (2003) Joost Engelfriet , Sebastian Maneth: Macro Tree Translations of Linear Size Increase are MSO Definable. SIAM J. Comput. 32 (4): 950-1006 (2003) Sebastian Maneth: The Complexity of Compositions of Deterministic Tree Transducers. FSTTCS 2002 : 265-276 Joost Engelfriet , Sebastian Maneth: Two-Way Finite State Transducers with Nested Pebbles. MFCS 2002 : 234-244 Geert Jan Bex , Sebastian Maneth, Frank Neven : A formal model for an expressive fragment of XSLT. Inf. Syst. 27 (1): 21-39 (2002) Joost Engelfriet , Sebastian Maneth: Output String Languages of Compositions of Deterministic Macro Tree Transducers. J. Comput. Syst. Sci. 64 (2): 350-395 (2002) Joost Engelfriet , Sebastian Maneth: Hierarchies of String Languages Generated by Deterministic Tree Transducers. Developments in Language Theory 2001 : 228-238 Geert Jan Bex , Sebastian Maneth, Frank Neven : A Formal Model for an Expressive Fragment of XSLT. Computational Logic 2000 : 1137-1151 Joost Engelfriet , Sebastian Maneth: Characterizing and Deciding MSO-Definability of Macro Tree Transductions. STACS 2000 : 542-554 Zoltán Fülöp , Sebastian Maneth: Domains of partial attributed tree transducers. Inf. Process. Lett. 73 (5-6): 175-180 (2000) Sebastian Maneth, Frank Neven : Structured Document Transformations Based on XSL. DBPL 1999 : 80-98 Sebastian Maneth: String Languages Generated by Total Deterministic Macro Tree Transducers. FoSSaCS 1999 : 258-272 Zoltán Fülöp , Sebastian Maneth: A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars. Grammatical Models of Multi-Agent Systems 1999 : 182-192 Sebastian Maneth: Cooperating Distributed Hyperedge Replacement Grammars. Grammars 1 (3): 193-208 (1999) Joost Engelfriet , Sebastian Maneth: Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Inf. Comput. 154 (1): 34-91 (1999) Sebastian Maneth: Cooperating Distributed Hyperedge Replacement Grammars. MFCS Workshop on Grammar Systems 1998 : 149-161 Joost Engelfriet , Sebastian Maneth: Tree Languages Generated be Context-Free Graph Grammars. TAGT 1998 : 15-29 Sebastian Maneth: The Generating Power of Total Deterministic Tree Transducers. Inf. Comput. 147 (2): 111-144 (1998) Sebastian Maneth, Heiko Vogler : Attributed Context-Free Hypergraph Grammars. Journal of Automata, Languages and Combinatorics 3 (2): 105-147 (1998) Heinz Faßbender , Sebastian Maneth: A Strict Border for the Decidability of E-Unification for Recursive Functions. Journal of Functional and Logic Programming 1998 (4): (1998) Heinz Faßbender , Sebastian Maneth: A Strict Border for the Decidability of E-Unification for Recursive Functions. ALP 1996 : 194-208 1 [ 24 ] 2 [ 14 ] [ 17 ] 3 [ 23 ] [ 26 ] 4 [ 5 ] [ 7 ] [ 13 ] [ 15 ] [ 16 ] [ 18 ] [ 20 ] [ 21 ] [ 25 ] 5 [ 1 ] [ 2 ] 6 [ 9 ] [ 12 ] 7 [ 26 ] [ 27 ] 8 [ 11 ] [ 14 ] [ 17 ] 9 [ 24 ] [ 28 ] 10 [ 24 ] [ 28 ] 11 [ 3 ]  ©2006 Association for Computing Machinery |
