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

1 bis 87 von 87 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)

Engelfriet, Joost; Vogler, Heiko: A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. In: arXiv:1905.00559 [cs.FL] (2019)

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

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

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

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

Osterholzer, Johannes; Dietze, Toni; Herrmann, Luisa: Linear Context-Free Tree Languages and Inverse Homomorphisms. In: Computing Research Repository (2015)

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)

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

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

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)

Stüber, Torsten: Consistency of Probabilistic Context-Free Grammars. In: Technical Reports (2012), S. 1–26

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

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)

Droste, Manfred; Vogler, Heiko: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. In: arXiv:1208.3942v1 [cs.FL] (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

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

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)

Radovanovic, Dragica: Weighted Tree Automata over Strong Bimonoids. In: Technical Report TUD-FI09-02 TUD-FI09-02 (2009)

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)

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

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

Högberg, Johanna; Maletti, Andreas; Vogler, Heiko: Bisimulation minimisation of weighted automata on unranked trees. In: Technical Report, Dresden University of Technology TUD-FI08-03 (2008)

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

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.: 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.: Pure and O-Substitution. In: Int. J. Found. Comput. Sci. 18(4) (2007), S. 829–845

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

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

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

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

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

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

Voigtländer, J.; Johann, P.: Selective Strictness and Parametricity in Structural Operational Semantics. In: Technical Report TUD-FI06-02, Technische Universität Dresden (2006)

Fülöp, Z.; Vogler, H.: A Comparison of Several Models of Weighted Tree Automata. In: Technical Report TUD-FI06-08, Technische Universität Dresden (2006)

Maletti, A.: Pure and O-Substitution. In: Technical Report TUD-FI06-05, Technische Universität Dresden (2006)

Droste, Manfred; Vogler, Heiko: Weighted Logics for XML. In: manuscript (2006)

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, 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, 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)

Maletti, A.: Compositions of Tree Series Transformations. In: Technical Report TUD-FI05-05 (2005)

Giesl, J.; Kühnemann, A.; Voigtländer, J.: Deaccumulation Techniques for Improving Provability. In: Technical Report TUD-FI05-14 (2005), S. 1–50

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, A.: Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations. In: Technical Report TUD-FI04-07 (2004), S. 1–34

Vogler, H.: φ-Recognizable Formal Power Series are φ-Rational - An Alternative Proof. In: Technical Report TUD-FI04-06 (2004), S. 1–18

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

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

Kühnemann, Armin; Voigtländer, Janis: Tree Transducer Composition as Deforestation Method for Functional Programs. In: TUD-FI01 - 07 - August 2001 (2001)

Voigtländer, Janis; Kühnemann, Armin: Composition of Functions with Accumulating Parameters. In: TUD-FI01-08 (2001)

Jürgensen, Claus: A Formalization of Hylomorphism Based Deforestation with an Application to an Extended Typed λ-Calculus. In: TUD-FI00-13 (2000)

Kühnemann, Armin: Comparison of deforestation techniques for functional programs and for tree transducers. In: TUD-FI99-01 (1999)


Diese Informationen werden vom FIS bereitgestellt.
Stand: 21.11.2019 12:01 Uhr