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

1 bis 89 von 89 Einträgen

Fülöp, Zoltán; Vogler, Heiko: Weighted Iterated Linear Control. In: Acta Informatica 56 (2019), Nr. 5, S. 447–469

Fülöp, Zoltán; Vogler, Heiko: Characterizations of recognizable weighted tree languages by logic and bimorphisms (DOI 10.1007/s00500-015-1717-2). In: Soft Computing 22 (2018), Nr. 4

Fülöp, Zoltán; Herrmann, Luisa; Vogler, Heiko: Weighted Regular Tree Grammars with Storage. In: Discrete Mathematics & Theoretical Computer Science 20(1) (2018), Nr. #26

Teichmann, Markus: Regular Approximation of Weighted Linear Context-Free Tree Languages. In: International Journal of Foundations of Computer Science 28 (2017), Nr. 5, S. 523–542

Osterholzer, Johannes; Dietze, Toni; Herrmann, Luisa: Linear Context-Free Tree Languages and Inverse Homomorphisms. In: Information and Computation, accepted for publication (2017)

Droste, Manfred; Herrmann, Luisa; Vogler, Heiko: Weighted Automata with Storage. In: Information and Computation, accepted for publication (2017)

Gebhardt, Kilian; Nederhof, Mark-Jan; Vogler, Heiko: Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures. In: Computational Linguistics 43 (2017), Nr. 3, S. 465–520

Denkinger, Tobias: Chomsky-Schützenberger parsing for weighted multiple context-free languages. In: Journal of Language Modelling 5 (2017), Nr. 1, S. 3–55

Nederhof, Mark-Jan; Teichmann, Markus; Vogler, Heiko: Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. In: Journal of Automata, Languages and Combinatorics 21 (2016), Nr. 3, S. 203–246

Fülöp, Zoltán; Vogler, Heiko: Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics. In: Theoretical Computer Science 594 (2015), S. 82–105

Teichmann, Markus; Osterholzer, Johannes: A link between multioperator and tree valuation automata and logics. In: Theoretical Computer Science 594 (2015), S. 106–119

Droste, Manfred; Vogler, Heiko: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. In: International Journal of Foundations of Computer Science 25 (2014), Nr. 8, S. 955–969

Fülöp, Zoltán; Vogler, Heiko: Forward and Backward Application of Symbolic Tree Transducers. In: Acta Informatica 51 (2014), S. 297–325

Büchse, Matthias; Koller, Alexander; Vogler, Heiko: General binarization for parsing and translation. In: Proceedings of 51st Annual Meeting of the Association for Computational Linguistics (2013)

Droste, Manfred; Vogler, Heiko: Weighted Automata and Multi-Valued Logics over Arbitrary Bounded Lattices. In: Theoretical Computer Science 418 (2012), S. 14–36

Fülöp, Zoltán; Stüber, Torsten; Vogler, Heiko: A Büchi-like theorem for weighted tree automata over multioperator monoids. In: Theory of Computing Systems 50 (2012), Nr. 2, S. 241–278

Stüber, Torsten: Multioperator Weighted Monadic Datalog. In: Ausgezeichnete Informatikdissertationen 2011, GI-Edition - Lecture Notes in Informatics (LNI), D-12 (2012)

Büchse, Matthias; Nederhof, Mark-Jan; Vogler, Heiko: Tree Parsing for Tree-Adjoining Machine Translation. In: Journal of Logic and Computation 22 (2012), Nr. 6

Fülöp, Zoltán; Maletti, Andreas; Vogler, Heiko: Weighted extended tree transducers. In: Fundamenta Informaticae 111 (2011), Nr. 2, S. 163–202

Droste, Manfred; Vogler, Heiko: Weighted logics for unranked tree automata. In: Theory of Computing Systems 48 (2011), Nr. 1, S. 23–47

Droste, Manfred; Stüber, Torsten; Vogler, Heiko: Weighted finite automata over strong bimonoids. In: Information Sciences Vol 180 (2010), Nr. Issue 1, S. 156–166

Büchse, Matthias; May, Jonathan; Vogler, Heiko: Determinization of weighted tree automata using factorizations. In: Journal of Automata, Languages and Combinatorics (2010)

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

Ć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; 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

Stüber, Torsten; Vogler, Heiko; Fülöp, Zoltán: Decomposition of Weighted Multioperator Tree Automata. In: Int. J. Foundations of Computer Sci. 20 (2009), Nr. 2, S. 221–245

Johann, Patricia; Voigtländer, Janis: A Family of Syntactic Logical Relations for the Semantics of Haskell-like Languages. In: Information and Computation 207(2) (2009), S. 341–368

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

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)

Drewes, Frank; Vogler, Heiko: Learning deterministically recognizable tree series. In: Journal of Automata, Languages and Combinatorics 12 (2007), Nr. 3, S. 332–354

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

Giesl, J.; Kühnemann, Armin; Voigtländer, Janis: Deaccumulation Techniques for Improving Provability. In: Journal of Logic and Algebraic Programming (2007)

Voigtländer, Janis; Johann, P.: Selective strictness and parametricity in structural operational semantics, inequationally. In: Theoretical Computer Science 388 (2007), Nr. 1–3, S. 290–318

Voigtländer, J.: Formal Efficiency Analysis for Tree Transducer Composition. In: Theory of Computing Systems 41 (2007), Nr. 4, S. 619–689

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)

Johann, P.; Voigtländer, J.: The Impact of seq on Free Theorems-Based Program Transformations. In: Fundamenta Informaticae 69 (1-2) (2006), S. 63–102

Maletti, A.: Compositions of tree series transformations. In: Theoret. Comput. Sci. 366(3) (2006), S. 248–271

Borchardt, B.; Maletti, A.; Seselja, B.; Tepavcevic, A.; Vogler, H.: Cut sets as recognizable tree languages. In: Fuzzy Sets and Syst. 157(11) (2006), S. 1560–1571

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

Borchardt, Björn; Fülöp, Zoltán; Gazdag, Zsolt; Maletti, Andreas: Bounds for tree automata with polynomial costs. In: Journal of Automata, Languages and Combinatorics 10 (2005), S. 107–157

Maletti, A.: HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. In: Theoretical Computer Science (2005)

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

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)

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

Johann, P.; Voigtländer, J.: Free Theorems in the Presence of seq. In: 31st Symposium on Principles of Programming Languages - POPL'04, Venice, Italy, Proceedings, SIGPLAN Notices 39 (2004), S. 99–110

Voigtländer, J.; Kühnemann, A.: Composition of functions with accumulating parameters. In: Journal of Functional Programming 14 (2004), S. 317–363

Voigtländer, J.: Using Circular Programs to Deforest in Accumulating Parameters. In: Higher-Order and Symbolic Computation 17 (2004), S. 129–163

Borchardt, B.: A Pumping Lemma and Decidability Problems for Recognizable Tree Series. In: Acta Cybernetica 16 (2004), S. 509–544

Voigtländer, J.: Formal Efficiency Analysis for Tree Transducer Composition. In: Technical Report TUD-FI04-08 (2004), S. 1–93

Maletti, A.: Relating Tree Series Transducers and Weighted Tree Automata. In: Proc. 8th Int. Conf. Developments in Language Theory, LNCS 3340 (2004), S. 321–333

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

Voigtländer, Janis: Concatenate, reverse and map vanish for free. In: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming - ICFP ’02 (2002), S. 14–25

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

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

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

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