For advanced search options you can also view this in the Forschungsinformationssystem of the TU Dresden.

1 bis 70 von 70 Einträgen

Fülöp, Zoltán; Stüber, Torsten; Vogler, Heiko: A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. In: Theory Comput Syst 50 (2010), Nr. 2, S. 163–202

DeNeefe, Steve; Knight, Kevin; Vogler, Heiko: A Decoder for Probabilistic Syncronous Tree Insertion Grammars. In: Proc. of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing Vol. 1 (2010), S. 10–18

Droste, Manfred; Vogler, Heiko: Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices. In: Developments in Language Theory, Lecture Notes in Computer Science Vol. 6224 (2010), S. 160–172

Ćirić, Miroslav; Droste, Manfred; Ignjatović, Jelena; Vogler, Heiko: Determinization of weighted finite automata over strong bimonoids. In: Information Sciences, Information Sciences Vol. 180 (2010), Nr. Issue 18, S. 3497–3520

Fülöp, Zoltán; Vogler, Heiko: Weighted tree automata and tree transducers. In: Handbook of Weighted Automata (2009), S. 313–403

Fülöp, Zoltán; Maletti, Andreas; Vogler, Heiko: A Kleene theorem for weighted tree automata over distributive multioperator monoids. In: Theory of Computing Systems 44 (2009), Nr. 3, S. 455–499

Manfred, Droste; Werner, Kuich; Heiko, Vogler ; Manfred, Droste (Hrsg.): Handbook of Weighted Automata : Springer (2009)

Voigtländer, Janis: Free Theorems Involving Type Constructor Classes : 14th International Conference on Functional Programming - ICFP'09, Edinburgh, Scotland. In: Proceedings, ACM Press (2009)

Maletti, Andreas; Vogler, Heiko: Compositions of Top-down Tree Transducers with Epsilon-rules : in: Finite-State Methods and Natural Language Processing - FSMNLP 2009, 8th International Workshop. In: Proceedings (2009)

Droste, Manfred; Vogler, Heiko: Weighted logics for unranked tree automata. In: Theory of Computing Systems, accepted for publication, 2009 (2009)

Büchse, Matthias; Stüber, Torsten: Monadic Datalog Tree Transducers. In: Lecture Notes in Computer Science vol. 5457 (2009), S. 267–278

Högberg, Johanna; Maletti, Andreas; Vogler, Heiko: Bisimulation Minimisation of Weighted Automata on Unranked Trees. In: Fundamenta Informaticae 92(1-2) (2009), S. 103–130

Droste, Manfred; Sakarovitch, Jacques; Vogler, Heiko: Weighted Automata with Discounting. In: Information Processing Letters 108 (2008), pages 23-28 (2008)

Seselja, Branimir; Tepavcevic, Andreja; Vogler, Heiko: A note on cut-worthyness of recognizable tree series. In: Fuzzy Sets and Systems 159 (2008), 3087-3090 (2008)

Stüber, Torsten; Vogler, Heiko: Weighted monadic datalog. In: Theoretical Computer Science 403, pages 221-238 (2008)

Voigtländer, Janis; Stenger, Florian: Parametricity for Haskell with Imprecise Error Semantics. In: Technical Report, Dresden University of Technology TUD-FI08-08 (2008)

Voigtländer, Janis: Proving Correctness via Free Theorems: The Case of the destroy/build-Rule. In: PEPM'08, San Francisco, California, Proceedings, pages 13-20, ACM Press, (2008)

Högberg, J.; Maletti, A.; May, J.: Backward and Forward Bisimulation Minimisation of Tree Automata. In: Technical Report ISI-TR-633 (2007)

Högberg, J.; Maletti, A.; May, J.: Bisimulation Minimisation of Weighted Tree Automata. In: Technical Report ISI-TR-634 (2007)

Vogler, H.; Fülöp, Z.; Maletti, A.: A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. In: Theory Comput. Syst. (2007)

Maletti, A.: Pure and O-Substitution. In: Int. J. Found. Comput. Sci. 18(4) (2007), S. 829–845

Maletti, A.; Vogler, H.: Incomparability Results for Classes of Polynomial Tree Series Transformations. In: J. Automata, Languages and Combinatorics (2007)

Droste, M.; Vogler, H.: Weighted tree automata and weighted logics. In: Theoretical Computer Science 366 (2006), S. 228–247

Droste, Manfred; Pech, Christian; Vogler, Heiko: A Kleene theorem for weighted tree automata. In: Theory Comput. Syst. 38 (2005), S. 1–38

Maletti, A.: Relating tree series transducers and weighted tree automata. In: International Journal of Foundations of Computer Science 16(4) (2005), S. 723–741

Johann, P.; Voigtländer, J.: The impact of seq on Free Theorems-Based Program Transformations. In: Fundamenta Informaticae (2005)

Voigtländer, J.: Formal Efficiency Analysis for Tree Transducer Composition. In: Theory of Computing Systems (2005)

Borchardt, B.; Maletti, A.; Seselja, B.; Tepavcevic, A.; Vogler, H.: Cut sets as Recognizable Tree Languages. In: Fuzzy Sets and Systems (2005)

Droste, M.; Vogler, H.: Recognizable and Rational Formal Power Series with General Discounting. In: Technical Report TUD-FI05-06 (2005)

Fülöp, Z.; Muzamel, L.: Decomposition Results for Pebble Macro Tree Transducers. In: Technical Report TUD-FI05-13 (2005), S. 1–41

Fülöp, Z.; Kühnemann, A.; Vogler, H.: Linear deterministic multi bottom-up tree transducers. In: Theoretical Computer Science 347 (2005), S. 276–287

Jürgensen, C.; Vogler, H.: Syntactic composition of top-down tree transducers is short cut fusion. In: Mathematical Structures in Computer Science 14 (2004), S. 215–282

Droste, M.; Vogler, H.: Weighted Automata: Theory and Applications. In: Technical Report TUD-FI04-05 (2004), S. 1–61

Fülöp, Z.; Gazdag, Zs.; Vogler, H.: Hierarchies of Tree Series Transformations. In: Theoretical Computer Science 314 (2004), S. 387–429

Fülöp, Z.; Kühnemann, A.; Vogler, H.: A Bottom-up Characterization of Deterministic Top-down Tree Transducers with Regular Look-Ahead. In: Information Processing Letters 91 (2004), S. 57–67

Pöschel, R.; Semigrodskikh, A.; Vogler, H.: On clones of tree functions closed under primitive recursion. In: Acta Cybernetica 16 (2004), S. 411–425

Fülöp, Z.; Vogler, H.: Weighted tree transducers. In: Journal of Automata, Languages and Combinatorics 9 (2004), S. 31–54

Fülöp, Zoltán; Vogler, Heiko: Tree series transformations that respect copying. In: Theory Comput. Syst. 36 (2003), Nr. 3, S. 247–293

Engelfriet, Joost; Fülöp, Zoltán; Vogler, Heiko: Bottom-up and top-down tree series transformations. In: Journal of Automata, Languages and Combinatorics 7 (2001), Nr. 1, S. 11–70

Noll, T.; Vogler, Heiko: The universality of higher-order attributed tree transducers. In: Theory of Computing Systems 34 (2001), Nr. 1, S. 45–75

Kühnemann, Armin: Attribute Grammars and Program Optimization (2001)

Kühnemann, Armin: Elimination of Intermediate Results in Functional Programs. In: Workshop Programmiersprachen und Grundlagen der Programmierung 263 (2000), Nr. 1/2000, S. 105–112

Kühnemann, Armin: Benefits of tree transducers for optimizing functional programs. In: International Colloquium “Partial Evaluation and Program Transformation”, Waseda University (2000), S. 61–82

Hofstedt, P.: A Functional Logic Language as Hostlanguage for a System of Combined Constraint Solvers. In: Proceedings of the 8th International Conference on Functional and Logic Programming (1999)

Fülöp, Zoltán; Vogler, Heiko: A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. In: Theory of Comput. Systems 32 (1999), S. 649–676

Maneth, S.; Vogler, Heiko: Attributed context-free hypergraph grammars. In: Automata, Languages and Combinatorics 2 (1998), S. 105–147

Engelfriet, Joost; Vogler, Heiko: The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. In: Journal of Computer and System Sciences 56 (1998), S. 332–356

Kühnemann, Armin: Benefits of tree Transducers for optimizing functional programs. In: Proceedings of the 18th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1998 1530 (1998), S. 146–157

Fülöp, Zoltán; Vogler, Heiko: Syntax-directed semantics. Monographs in Theoretical Computer Science : Springer (1998)

Kühnemann, Armin: A two-dimensional hierarchy for attributed tree transducers. In: Proceeding of the 11th International Symposium on Fundamentals of Computation Theory (1997), S. 281–292

Mößle, A.; Vogler, Heiko: Benefits of Hypergraphs for Program Transformation. In: Proceedings Informatik '97 (1997), S. 572–581

Kühnemann, Armin; Vogler, Heiko: Attributgrammatiken : Vieweg (1997)

Faßbender, H.; Mößle, A.; Vogler, Heiko: Implementation of a deterministic partial E-unification algorithm for macro tree transducers. In: Journal of Functional and Logic Programming (1996), Nr. 2

Kühnemann, Armin: A pumping lemma for output languages of macro tree transducers. In: Proceedings of the 21st International Colloquium on Trees in Algebra and Programming – CAAP'96 1059 (1996), S. 44–58

Engelfriet, Joost; Vogler, Heiko: The translation power of top-down tree-to-graph transducers. In: Journal of Computer and System Sciences 49 (1994), Nr. 2, S. 258–305

Noll, T.; Vogler, Heiko: Top-down parsing with simultaneous attribute evaluation. In: Fund. Inform. 20 (1994), S. 285–332

Kühnemann, Armin; Vogler, Heiko: A pumping lemma for output languages of attributed tree transducers. In: Acta Cybernet. 11 (1994), S. 261–305

Kühnemann, Armin; Vogler, Heiko: Synthesized and inherited functions. In: Acta Informatica 31 (1994), Nr. 5, S. 431–477

Faßbender, H.; Vogler, Heiko: A universal unification algorithm based on unification-driven leftmost outermost narrowing. In: Acta Cybernet. 11 (1994), S. 139–167

Fülöp, Zoltán; Herrmann, F.; Vagvölgyi, S.; Vogler, Heiko: Tree transducers with external functions. In: Theoret. Comput. Sci. 108 (1993), S. 185–236

Faßbender, H.; Vogler, Heiko: An implementation of syntax directed functional programming on nested-stack machines. In: Formal Aspects of Comput. 4 (1992), S. 341–375

Vogler, Heiko: Functional description of the contextual analysis in block — structured programming languages: a case study of tree transducers. In: Science of Comput. Prog. 16 (1991), S. 251–275

Engelfriet, J.; Vogler, H.: Modular tree transducers. In: Theoret. Comput. Sci. 78 (1991), S. 267–303

Vogler, Heiko: The OI-hierarchy is closed under control. In: Inform. and Comput. 78 (1988), S. 187–204

Engelfriet, Joost; Vogler, Heiko: High level tree transducers and iterated pushdown tree transducers. In: Acta Inform. 26 (1988), S. 131–192

Vogler, Heiko: Basic tree transducers. In: J. Comput. System Sci. 34 (1987), S. 87–128

Engelfriet, Joost; Vogler, Heiko: Look-ahead on pushdowns. In: Inform. and Comput. 73 (1987), S. 245–279

Engelfriet, Joost; Vogler, Heiko: Pushdown machines for the macro tree transducer. In: Theoret. Comput. Sci. 42 (1986), Nr. 3, S. 251–368

Vogler, Heiko: Iterated linear control and iterated one-turn pushdowns. In: Math. Systems Theory 19 (1986), S. 117–133

Engelfriet, Joost; Vogler, Heiko: Macro tree transducers. In: J. Comput. System Sci. 31 (1985), S. 71–146

Diese Informationen werden vom FIS bereitgestellt.
Stand: 20.11.2019 22:26 Uhr