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

1 bis 96 von 96 Einträgen

Nederhof, Mark-Jan; Vogler, Heiko: Regular transductions with MCFG input syntax. In: Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2019) (2019)

Mörbitz, Richard; Vogler, Heiko: Weighted parsing for grammar-based language models. In: Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2019) (2019)

Fülöp, Zoltán; Vogler, Heiko: Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. In: Proceedings of the 8th International Conference on Algebraic Informatics, Lecture Notes in Computer Science 11545 (2019), S. 138–150

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

Ruprecht, Thomas; Denkinger, Tobias: Implementation of a Chomsky-Schützenberger n-best parser for weighted multiple context-free grammars. In: Proceedings of the 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2019)

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

Gebhardt, Kilian: Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing. In: Proceedings of the 27th International Conference on Computational Linguistics (2018), S. 3049–3063

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: Approximation of Weighted Automata with Storage. In: Proceedings of the 8th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2017), Electronic Proceedings in Theoretical Computer Science 256 (2017)

Herrmann, Luisa: A Medvedev Characterization of Recognizable Tree Series. In: Proceedings of 21th International Conference on Developments in Language Theory (DLT 2017), Lecture Notes in Computer Science 10396 (2017), S. 210–221

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

Denkinger, Tobias: An Automata Characterisation for Multiple Context-Free Languages. In: Proceedings of the 20th International Conference on Developments in Language Theory (DLT 2016), Lecture Notes in Computer Science 9840 (2016), S. 138–150

Herrmann, Luisa; Vogler, Heiko: Weighted Symbolic Automata with Data Storage. In: Proc. of 20th International Conference on Developments in Language Theory (DLT 2016), Lecture Notes in Computer Science 9840 (2016), S. 203–215

Drewes, Frank; Gebhardt, Kilian; Vogler, Heiko: EM-Training for Weighted Aligned Hypergraph Bimorphisms. In: Proceedings of the ACL Workshop on Statistical Natural Language Processing and Weighted Automata (StatFSM 2016) (2016), S. 60–69

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

Dietze, Toni: Equivalences between Ranked and Unranked Weighted Tree Automata via Binarization. In: Proceesings of the ACL Workshop on Statistical Natural Language Processing and Weighted Automata (StatFSM 2016) (2016), S. 1–10

Teichmann, Markus: Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages. In: Proceedings of the 21st International Conference on Implementation and Application of Automata (CIAA 2016), Lecture Notes in Computer Science 9705 (2016), S. 273–284

Osterholzer, Johannes; Dietze, Toni; Herrmann, Luisa: Linear Context-Free Tree Languages and Inverse Homomorphisms. In: Proceedings of the 10th International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 9618 (2016), S. 478–489

Vogler, Heiko; Droste, Manfred; Herrmann, Luisa: A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem. In: Proceedings of the 10th International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 9618 (2016), S. 127–139

Osterholzer, Johannes: Complexity of Uniform Membership of Context-Free Tree Grammars. In: Proceedings of the 6th International Conference on Algebraic Informatics (CAI 2015), Lecture Notes in Computer Science, Vol. 9270 (2015), S. 176–188

Dietze, Toni; Nederhof, Mark-Jan: Count-Based State Merging for Probabilistic Regular Tree Grammars. In: Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015) (2015)

Gebhardt, Kilian; Osterholzer, Johannes: A direct link between Tree-Adjoining and Context-Free Tree Grammars. In: Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015) (2015)

Denkinger, Tobias: A Chomsky-Schützenberger representation for weighted multiple context-free languages. In: Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015) (2015)

Herrmann, Luisa; Vogler, Heiko: A Chomsky-Schützenberger Theorem for Weighted Automata with Storage. In: Proceedings of the 6th International Conference on Algebraic Informatics (CAI 2015), Lecture Notes in Computer Science 9270 (2015), S. 115–127

Droste, Manfred; Heusel, Doreen; Vogler, Heiko: Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics. In: Proceedings of the 6th International Conference on Algebraic Informatics (CAI 2015), Lecture Notes in Computer Science 9270 (2015), S. 90–102

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

Osterholzer, Johannes: Pushdown Machines for Weighted Context-Free Tree Translation. In: Proceedings of 19th International Conference on Implementation and Application of Automata (CIAA 2014) (2014), S. 290–303

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

Nederhof, Mark-Jan; Vogler, Heiko: Hybrid Grammars for Discontinuous Parsing. In: Proceedings of the 25th International Conference on Computational Linguistics (COLING 2014): Technical Papers (2014)

Droste, Manfred; Vogler, Heiko: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. In: Proceedings of the 17th International Conference on Developments in Language Theory (DLT 2013) (2013)

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; Maletti, Andreas; Vogler, Heiko: Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. In: Proceedings of the 16th international conference on Developments in Language Theory (2012), S. 368–379

Nederhof, Mark-Jan; Vogler, Heiko: Synchronous Context-Free Tree Grammars. In: Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11) (2012), S. 55–63

Osterholzer, Johannes; Stüber, Torsten: State-Split for Hypergraphs with an Application to Tree Adjoining Grammars. In: Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11) (2012), S. 180–188

Büchse, Matthias; Fischer, Anja: Deciding the Twins Property for Weighted Tree Automata over Extremal Semifields. In: Proceedings EACL 2012 Workshop on Applications of Tree Automata Techniques in Natural Language Processing (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

Büchse, Matthias ; Nederhof, Mark-Jan; Vogler, Heiko: Tree Parsing with Synchronous Tree-Adjoining Grammars. In: Proc. of 12th International Conference on Parsing Technologies (IWPT 2011), Association for Computational Linguistics (2011), S. 14–25

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

Maletti, Andreas; Vogler, Heiko: Compositions of Top-Down Tree Transducers with ε-Rules. In: Finite-State Methods and Natural Language Processing, Lecture Notes in Computer Science Vol 6062 (2010), S. 69–80

May, Jonathan; Knight, Kevin; Vogler, Heiko: Efficient Inference Through Cascades of Weighted Tree Transducers. In: Proc. of 48th Annual Meeting of the Association for Computational Linguistics Vol. 1 (2010), S. 1058–1066

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; Maletti, Andreas; Vogler, Heiko: Preservation of Recognizability for Syncronous Tree Substitution Grammars. In: Proc. of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing Vol. 1 (2010), S. 1–9

Büchse, Matthias; Stüber, Torsten; Vogler, Heiko; Geisler, Daniel: n-Best Parsing Revisited. In: Proc. of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing Vol. 1 (2010), S. 46–54

Geisler, Daniel; Stüber, Torsten: Weighted Monadic Datalog Tree Transducers. In: Technical Report TUD-FI10-07-Dezember 2010 (2010)

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

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

Voigtländer, Janis: Bidirectionalization for Free! In: Proceedings of the 36th Symposium on Principles of Programming Languages - POPL'09, rn36th Symposium on Principles of Programming Languages - POPL'09 (2009), S. 165–176

Stenger, Florian; Voigtländer, Janis: Parametricity for Haskell with Imprecise Error Semantics. In: Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications - TLCA'09 volume 5608 of LNCS (2009), S. 294–308

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

Seidel, Daniel; Voigtländer, Janis: Taming Selective Strictness. In: ATPS'09 (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

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)

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

Maletti, A.: Learning deterministically recognizable tree series revisited. In: Proc. 2nd Int. Conf. Algebraic Informatics LNCS 4728 (2007), S. 218–235

Högberg, J.; Maletti, Andreas; May, J.: Bisimulation minimisation for weighted tree automata. In: Proc. 11th Int. Conf. Developments in Language Theory LNCS 4588 (2007), S. 229–241

Högberg, J.; Maletti, Andreas; May, J.: Backward and forward bisimulation minimisation of tree automata. In: Proc. 12th Int. Conf. Implementation and Application of Automata LNCS 4783 (2007), S. 109–121

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

Maletti, A.: Hierarchies of tree series transformations revisited. In: Proceedings of DLT 2006, Lecture Notes in Computer Science 4036 (2006), S. 215–225

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

Maletti, A.: Does o-substitution preserve recognizability? In: Proceedings of CIAA 2006, Lecture Notes in Computer Science 4094 (2006), S. 150–161

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

Borchardt, Björn: Code Selection by Tree Series Transducers. In: 9th International Conference on Implementation and Application of Automata, CIAA'04, Kingston, Canada 3317 (2005), S. 57–67

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)

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

Maletti, Andreas: Myhill-Nerode theorem for sequential transducers over unique GCD-monoids. In: Proceedings of the 9th International Conference on Implementation and Application of Automata, LNCS 3317 (2004), S. 323–324

Borchardt, Björn: The Myhill-Nerode theorem for recognizable tree series. In: 7th International Conference on Developments in Language Theory, DLT'03, Szeged, Hungary 2710 (2003), S. 146–158

Borchardt, Björn; Vogler, Heiko: Determinization of finite state weighted tree automata. In: J. Autom. Lang. Comb. 8 (2003), Nr. 3, S. 417–463

Giesl, Jürgen; Kühnemann, Armin; Voigtländer, Janis: Deaccumulation — Improving Provability. In: 8th Asian Computing Science Conference, ASIAN 2003 2896 (2003), S. 146–160

Voigtländer, Janis: Conditions for efficiency improvement by tree transducer composition. In: 13th International Conference on Rewriting Techniques and Applications 2378 (2002), S. 222–236

Voigtländer, Janis: Using Circular Programs to Deforest in Accumulating Parameters. In: ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (2002)

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

Kühnemann, Armin; Glück, R.; Kakehi, K.: Relating Accumulative and Non-Accumulative Functional Programs. In: 12th International Conference on Rewriting Techniques and Applications -- RTA'01, Utrecht, The Netherlands, Proceedings 2051 (2001), S. 154–168


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