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

1 bis 72 von 72 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

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)

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

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: 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

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

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

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; 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 with Synchronous Tree-Adjoining Grammars. In: Proc. of 12th International Conference on Parsing Technologies (IWPT 2011), Association for Computational Linguistics (2011), S. 14–25

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

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

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

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

Büchse, Matthias; May, Jonathan; Vogler, Heiko: Determinization of weighted tree automata using factorizations. In: Finite-State Methods and Natural Language Processing - FSMNLP 2009, 8th International Workshop (2009)

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)

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

Voigtländer, Janis: Proving Correctness via Free Theorems: The Case of the destroy/build-Rule. In: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation - PEPM'08 (2008), S. 13–20

Voigtländer, Janis: Much Ado about Two: A Pearl on Parallel Prefix Computation. In: Proceedings of the 35th Symposium on Principles of Programming Languages - POPL'08; SIGPLAN Notices 43 (2008), Nr. 1, S. 29–35

Voigtländer, Janis: Semantics and Pragmatics of New Shortcut Fusion Rules. In: Proceedings of the 9th International Symposium on Functional and Logic Programming - FLOPS'08; LNCS 4989 (2008), S. 163–179

Voigtländer, Janis: Asymptotic Improvement of Computations over Free Monads. In: Proceedings of the 9th International Conference on Mathematics of Program Construction - MPC'08; LNCS 5133 (2008), S. 388–403

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)

Maletti, A.: Compositions of extended top-down tree transducers. In: Proc. 1st Int. Conf. Language and Automata Theory and Applications. Report 35/07 (2007), S. 379–390

Maletti, A.: Myhill-Nerode theorem for recognizable tree series revisited. In: Proc. 1st Int. Conf. AutoMathA: From Mathematics to Applications (2007)

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

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

Kühnemann, A.; Maletti, A.: The Substitution Vanishes. In: Proceedings of AMAST 2006, Lecture Notes in Computer Science 4019 (2006), S. 173–188

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: 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, Andreas: The power of tree series transducers of type I and II. In: 9th International Conference on Developments in Language Theory, DLT 2005, Palermo, Italy 3572 (2005), S. 338–349

Maletti, A.: Compositions of bottom-up tree series transformations. In: Proceedings 11th International Conference on Automata and Formal Languages, University of Szeged (2005), S. 187–199

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)

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

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

Kühnemann, Armin: Comparison of deforestation techniques for functional programs and for tree transducers. In: 4th Fuji International Symposium on Functional and Logic Programming - FLOPS'99, Tsukuba 1722 (1999), S. 114–130

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)

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

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: 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


Diese Informationen werden vom FIS bereitgestellt.
Stand: 13.11.2019 13:34 Uhr