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

1 bis 42 von 42 Einträgen

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

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)

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

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

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

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

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

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected papers of the Workshop Weighted Automata: Theory and Applications (WATA 2012). Theoretical Computer Science 534, Nr. 1 (2014)

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)

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)

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, M. (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2010). Acta Cybernetica 20, Nr. 2 (2011)

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

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

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

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2008). Acta Cybernetica 19, Nr. 2. Szeged, Ungarn (2009)

Seidel, Daniel; Voigtländer, Janis: Taming Selective Strictness. In: ATPS'09 (2009)

Droste, Manfred (Hrsg.); Kuich, Werner (Hrsg.); Vogler, Heiko (Hrsg.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science : Springer (2009)

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2006). Languages and Combinatorics 12, Nr. 4 (2007)

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2004). Journal of Automata, Languages and Combinatorics 10, Nr. 2-3 (2005)

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2002). Journal of Automata, Languages and Combinatorics 8 (2003)

Vogler, Heiko (Hrsg.): International Workshop on Grammars, Automata, and Logic on Graphs and Trees. Dresden, Germany (1999)

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

Vogler, Heiko (Hrsg.): Arbeitstreffen über: Grundlagen, Spezifikation, Implementierung und Verifikation von Programmiersprachen. Dresden, Germany (1996)


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