Andreas Maletti

130 papers A* 2A 2B 5C 28Misc 1Journal 56Unranked 31

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Attack Resilience Hyperproperties: Formal Security Analysis of (Automotive) Network Architectures Under Active Compromise. SEFM Julius Figge, David Knuplesch, Andreas Maletti, Dragan Zuvic
2024	J	`jnl`	Compositions of Weighted Extended Tree Transducers - The Unambiguous Case. Int. J. Found. Comput. Sci. Andreas Maletti
2024	A	`conf`	Weighted HOM-Problem for Nonnegative Integers. STACS Andreas Maletti, Andreea-Teodora Nász, Erik Paul
2024	J	`jnl`	Weighted Tree Automata with Constraints. Theory Comput. Syst. Andreas Maletti, Andreea-Teodora Nász
2023	J	`jnl`	Ambiguity Hierarchies for Weighted Tree Automata. Int. J. Found. Comput. Sci. Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht
2023	J	`jnl`	Combinatory categorial grammars as generators of weighted forests. Inf. Comput. Andreas Maletti, Lena Katharina Schiffer
2023	J	`jnl`	Compositions with Constant Weighted Extended Tree Transducers. Int. J. Found. Comput. Sci. Malte Blattmann, Andreas Maletti
2023	—	`conf`	Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings. AFL Andreas Maletti, Nils Oskar Nuernbergk
2023	C	`conf`	Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable. CIAA Andreas Maletti, Andreea-Teodora Nász
2023	J	`jnl`	Weighted HOM-Problem for Nonnegative Integers. CoRR Andreas Maletti, Andreea-Teodora Nász, Erik Paul
2023	J	`jnl`	Weighted Tree Automata with Constraints. CoRR Andreas Maletti, Andreea-Teodora Nász
2023	J	`jnl`	Weighted two-way transducers. Inf. Comput. Fan Feng, Andreas Maletti
2022	J	`jnl`	Preface. Inf. Comput. Manfred Droste, Andreas Maletti, Heiko Vogler
2022	J	`jnl`	Strong Equivalence of TAG and CCG. CoRR Andreas Maletti, Lena Katharina Schiffer
2022	J	`jnl`	The tree-generative capacity of combinatory categorial grammars. J. Comput. Syst. Sci. Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer
2022	C	`conf`	Weighted Tree Automata with Constraints. DLT Andreas Maletti, Andreea-Teodora Nász
2022	—	`conf`	Weighted Two-Way Transducers. CAI Fan Feng, Andreas Maletti
2021	C	`conf`	Ambiguity Hierarchies for Weighted Tree Automata. CIAA Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht
2021	C	`conf`	Compositions of Constant Weighted Extended Tree Transducers. DLT Malte Blattmann, Andreas Maletti
2021	J	`jnl`	Strong Equivalence of TAG and CCG. Trans. Assoc. Comput. Linguistics Lena Katharina Schiffer, Andreas Maletti
2020	C	`conf`	On Tree Substitution Grammars. DLT Andreas Maletti, Kevin Stier
2019	C	`conf`	Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. CIAA Zoltán Fülöp, Andreas Maletti
2019	—	`ed.`	Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, FSMNLP 2019, Dresden, Germany, September 23-25, 2019 FSMNLP Heiko Vogler, Andreas Maletti
2019	—	`conf`	The Tree-Generative Capacity of Combinatory Categorial Grammars. FSTTCS Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer
2018	J	`jnl`	Compositions of Tree-to-Tree Statistical Machine Translation Models. Int. J. Found. Comput. Sci. Andreas Maletti
2018	J	`jnl`	Multiple context-free tree grammars: Lexicalization and characterization. Theor. Comput. Sci. Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2018	J	`jnl`	Pushing for weighted tree automata. Log. Methods Comput. Sci. Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
2018	—	`conf`	Recurrent Neural Networks as Weighted Language Recognizers. NAACL-HLT Yining Chen, Sorcha Gilroy, Andreas Maletti, Jonathan May, Kevin Knight
2017	J	`jnl`	Composition Closure of Linear Extended Top-down Tree Transducers. Theory Comput. Syst. Joost Engelfriet, Zoltán Fülöp, Andreas Maletti
2017	B	`conf`	Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. FCT Joost Engelfriet, Andreas Maletti
2017	J	`jnl`	Multiple Context-Free Tree Grammars: Lexicalization and Characterization. CoRR Joost Engelfriet, Andreas Maletti, Sebastian Maneth
2017	J	`jnl`	Pushing for weighted tree automata. CoRR Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
2017	J	`jnl`	Survey: Finite-state technology in natural language processing. Theor. Comput. Sci. Andreas Maletti
2017	J	`jnl`	Synchronous Forest Substitution Grammars. Acta Cybern. Andreas Maletti
2016	C	`conf`	Compositions of Tree-to-Tree Statistical Machine Translation Models. DLT Andreas Maletti
2016	J	`jnl`	Linking theorems for tree transducers. J. Comput. Syst. Sci. Zoltán Fülöp, Andreas Maletti
2015	—	`conf`	A systematic evaluation of MBOT in statistical machine translation. MTSummit Nina Seemann, Fabienne Braune, Andreas Maletti
2015	—	`ed.`	Algebraic Informatics - 6th International Conference, CAI 2015, Stuttgart, Germany, September 1-4, 2015. Proceedings CAI Andreas Maletti
2015	—	`conf`	Discontinuous Statistical Machine Translation with Target-Side Dependency Syntax. WMT@EMNLP Nina Seemann, Andreas Maletti
2015	—	`conf`	Extended Tree Transducers in Natural Language Processing. FSMNLP Andreas Maletti
2015	J	`jnl`	Hyper-optimization for deterministic tree automata. Theor. Comput. Sci. Andreas Maletti
2015	—	`conf`	String-to-Tree Multi Bottom-up Tree Transducers. ACL (1) Nina Seemann, Fabienne Braune, Andreas Maletti
2015	J	`jnl`	The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers. Int. J. Found. Comput. Sci. Andreas Maletti
2014	Misc	`conf`	A tunable language model for statistical machine translation. AMTA Junfei Guo, Juan Liu, Qi Han, Andreas Maletti
2014	J	`jnl`	Grammars, Parsers and Recognizers. J. Log. Comput. Harry Bunt, Andreas Maletti, Joakim Nivre
2014	—	`conf`	Hyper-Minimization for Deterministic Weighted Tree Automata. AFL Andreas Maletti, Daniel Quernheim
2014	—	`ed.`	Proceedings of the 2014 Joint Meeting of SIGMORPHON and SIGFSM, Baltimore, Maryland, USA, June 27, 2014 SIGMORPHON/SIGFSM Özlem Çetinoglu, Jeffrey Heinz, Andreas Maletti, Jason Riggle
2014	C	`conf`	The Power of Regularity-Preserving Multi Bottom-up Tree Transducers. CIAA Andreas Maletti
2013	J	`jnl`	Composition Closure of Linear Extended Top-down Tree Transducers CoRR Zoltán Fülöp, Andreas Maletti
2013	C	`conf`	Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. Developments in Language Theory Zoltán Fülöp, Andreas Maletti
2013	J	`jnl`	DIMwid - Decoder Inspection for Moses (using Widgets). Prague Bull. Math. Linguistics Robin Kurtz, Nina Seemann, Fabienne Braune, Andreas Maletti
2013	J	`jnl`	Hyper-Minimization for Deterministic Tree Automata. Int. J. Found. Comput. Sci. Artur Jez, Andreas Maletti
2013	C	`conf`	Hyper-optimization for Deterministic Tree Automata. CIAA Andreas Maletti
2013	—	`conf`	Random Generation of Nondeterministic Finite-State Tree Automata. TTATT Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
2013	—	`conf`	Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation. ACL (1) Fabienne Braune, Nina Seemann, Daniel Quernheim, Andreas Maletti
2013	—	`conf`	Synchronous Forest Substitution Grammars. CAI Andreas Maletti
2012	A	`conf`	Composing extended top-down tree transducers. EACL Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti
2012	—	`conf`	Every sensible extended top-down tree transducer is a multi bottom-up tree transducer. HLT-NAACL Andreas Maletti
2012	C	`conf`	Hyper-minimization for Deterministic Tree Automata. CIAA Artur Jez, Andreas Maletti
2012	—	`conf`	Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers. ATANLP@EACL Nina Seemann, Daniel Quernheim, Fabienne Braune, Andreas Maletti
2012	—	`conf`	Strong Lexicalization of Tree Adjoining Grammars. ACL (1) Andreas Maletti, Joost Engelfriet
2012	C	`conf`	Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. Developments in Language Theory Matthias Büchse, Andreas Maletti, Heiko Vogler
2012	J	`jnl`	Unweighted and Weighted Hyper-Minimization. Int. J. Found. Comput. Sci. Andreas Maletti, Daniel Quernheim
2011	J	`jnl`	An alternative to synchronous tree substitution grammars. Nat. Lang. Eng. Andreas Maletti
2011	C	`conf`	Computing All ℓ-Cover Automata Fast. CIAA Artur Jez, Andreas Maletti
2011	—	`ed.`	Finite-State Methods and Natural Language Processing, 9th International Workshop, FSMNLP 2010, Bois, France, July 12-16, 2011 FSMNLP Matthieu Constant, Andreas Maletti, Agata Savary
2011	A*	`conf`	How to train your multi bottom-up tree transducer. ACL Andreas Maletti
2011	—	`conf`	Hyper-minimisation of deterministic weighted finite automata over semifields. AFL Andreas Maletti, Daniel Quernheim
2011	J	`jnl`	MAT learners for tree series: an abstract data type and two realizations. Acta Informatica Frank Drewes, Johanna Högberg, Andreas Maletti
2011	—	`conf`	Notes on Hyper-minimization. AFL Andreas Maletti
2011	B	`conf`	On Minimising Automata with Errors. MFCS Pawel Gawrychowski, Artur Jez, Andreas Maletti
2011	J	`jnl`	On minimising automata with errors CoRR Pawel Gawrychowski, Artur Jez, Andreas Maletti
2011	J	`jnl`	Optimal Hyper-Minimization CoRR Andreas Maletti, Daniel Quernheim
2011	J	`jnl`	Optimal Hyper-Minimization. Int. J. Found. Comput. Sci. Andreas Maletti, Daniel Quernheim
2011	B	`conf`	Pushing for Weighted Tree Automata. MFCS Andreas Maletti, Daniel Quernheim
2011	—	`conf`	Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition. Algebraic Foundations in Computer Science Aurélie Lagoutte, Andreas Maletti
2011	J	`jnl`	Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power. Acta Cybern. Andreas Maletti
2011	J	`jnl`	Survey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation. Fundam. Informaticae Andreas Maletti
2011	J	`jnl`	The Category of Simulations for Weighted Tree Automata. Int. J. Found. Comput. Sci. Zoltán Ésik, Andreas Maletti
2011	—	`conf`	Tree Transformations and Dependencies. MOL Andreas Maletti
2011	J	`jnl`	Weighted Extended Tree Transducers. Fundam. Informaticae Zoltán Fülöp, Andreas Maletti, Heiko Vogler
2010	A*	`conf`	A Tree Transducer Model for Synchronous Tree-Adjoining Grammars. ACL Andreas Maletti
2010	J	`jnl`	An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. Markus Holzer, Andreas Maletti
2010	C	`conf`	Better Hyper-minimization - Not as Fast, But Fewer Errors. CIAA Andreas Maletti
2010	C	`conf`	Input Products for Weighted Extended Top-Down Tree Transducers. Developments in Language Theory Andreas Maletti
2010	—	`conf`	Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. ATANLP@ACL 2010 Andreas Maletti, Giorgio Satta
2010	—	`conf`	Preservation of Recognizability for Synchronous Tree Substitution Grammars. ATANLP@ACL 2010 Zoltán Fülöp, Andreas Maletti, Heiko Vogler
2010	J	`jnl`	Properties of Quasi-Relabeling Tree Bimorphisms. Int. J. Found. Comput. Sci. Andreas Maletti, Catalin Ionut Tîrnauca
2010	J	`jnl`	Simulation vs. Equivalence CoRR Zoltán Ésik, Andreas Maletti
2010	—	`conf`	Simulation vs. Equivalence. FCS Zoltán Ésik, Andreas Maletti
2010	J	`jnl`	Simulations of Weighted Tree Automata CoRR Zoltán Ésik, Andreas Maletti
2010	C	`conf`	Simulations of Weighted Tree Automata. CIAA Zoltán Ésik, Andreas Maletti
2010	—	`conf`	Survey: Tree Transducers in Machine Translation. NCMA Andreas Maletti
2010	—	`conf`	Why Synchronous Tree Substitution Grammars? HLT-NAACL Andreas Maletti
2009	—	`conf`	A Backward and a Forward Simulation for Weighted Tree Automata. CAI Andreas Maletti
2009	J	`jnl`	A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Theory Comput. Syst. Zoltán Fülöp, Andreas Maletti, Heiko Vogler
2009	C	`conf`	An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. CIAA Markus Holzer, Andreas Maletti
2009	J	`jnl`	Backward and forward bisimulation minimization of tree automata. Theor. Comput. Sci. Johanna Högberg, Andreas Maletti, Jonathan May
2009	J	`jnl`	Bisimulation Minimisation of Weighted Automata on Unranked Trees. Fundam. Informaticae Johanna Högberg, Andreas Maletti, Heiko Vogler
2009	—	`conf`	Compositions of Top-Down Tree Transducers with FSMNLP Andreas Maletti, Heiko Vogler
2009	J	`jnl`	Extended multi bottom-up tree transducers. Acta Informatica Joost Engelfriet, Eric Lilin, Andreas Maletti
2009	—	`conf`	Minimizing Weighted Tree Grammars Using Simulation. FSMNLP Andreas Maletti
2009	J	`jnl`	Minimizing deterministic weighted tree automata. Inf. Comput. Andreas Maletti
2009	—	`conf`	Parsing Algorithms based on Tree Automata. IWPT Andreas Maletti, Giorgio Satta
2009	J	`jnl`	Properties of quasi-alphabetic tree bimorphisms CoRR Andreas Maletti, Catalin Ionut Tîrnauca
2009	—	`conf`	Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. CAI Andreas Maletti, Catalin Ionut Tîrnauca
2009	J	`jnl`	The Power of Extended Top-Down Tree Transducers. SIAM J. Comput. Andreas Maletti, Jonathan Graehl, Mark Hopkins, Kevin Knight
2008	J	`jnl`	Compositions of extended top-down tree transducers. Inf. Comput. Andreas Maletti
2008	C	`conf`	Extended Multi Bottom-Up Tree Transducers. Developments in Language Theory Joost Engelfriet, Eric Lilin, Andreas Maletti
2008	C	`conf`	Minimizing Deterministic Weighted Tree Automata. LATA Andreas Maletti
2008	B	`conf`	Myhill-Nerode Theorem for Recognizable Tree Series Revisited. LATIN Andreas Maletti
2008	C	`conf`	Tree-Series-to-Tree-Series Transformations. CIAA Andreas Maletti
2007	C	`conf`	Backward and Forward Bisimulation Minimisation of Tree Automata. CIAA Johanna Högberg, Andreas Maletti, Jonathan May
2007	C	`conf`	Bisimulation Minimisation for Weighted Tree Automata. Developments in Language Theory Johanna Högberg, Andreas Maletti, Jonathan May
2007	C	`conf`	Compositions of Extended Top-down Tree Transducers. LATA Andreas Maletti
2007	—	`conf`	Learning Deterministically Recognizable Tree Series - Revisited. CAI Andreas Maletti
2007	J	`jnl`	Pure and O-Substitution. Int. J. Found. Comput. Sci. Andreas Maletti
2006	J	`jnl`	Compositions of tree series transformations. Theor. Comput. Sci. Andreas Maletti
2006	J	`jnl`	Cut sets as recognizable tree languages. Fuzzy Sets Syst. Björn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic, Heiko Vogler
2006	C	`conf`	Does o-Substitution Preserve Recognizability? CIAA Andreas Maletti
2006	C	`conf`	Hierarchies of Tree Series Transformations Revisited. Developments in Language Theory Andreas Maletti
2006	—	`conf`	The Substitution Vanishes. AMAST Armin Kühnemann, Andreas Maletti
2006	—	`—`	The power of tree series transducers. Andreas Maletti
2005	J	`jnl`	Bounds for Tree Automata with Polynomial Costs. J. Autom. Lang. Comb. Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti
2005	J	`jnl`	HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. Theor. Comput. Sci. Andreas Maletti
2005	J	`jnl`	Incomparability Results for Classes of Polynomial Tree Series Transformations. J. Autom. Lang. Comb. Andreas Maletti, Heiko Vogler
2005	J	`jnl`	Relating tree series transducers and weighted tree automata. Int. J. Found. Comput. Sci. Andreas Maletti
2005	C	`conf`	The Power of Tree Series Transducers of Type I and II. Developments in Language Theory Andreas Maletti
2004	C	`conf`	Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. CIAA Andreas Maletti
2004	C	`conf`	Relating Tree Series Transducers and Weighted Tree Automata. Developments in Language Theory Andreas Maletti