The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Andreas Maletti" ( http://dblp.L3S.de/Authors/Andreas_Maletti )

  Author page on DBLP  Author page in RDF  Community of Andreas Maletti in ASPL-2

Publication years (Num. hits)
2004-2007 (18) 2008-2009 (18) 2010-2011 (28)
Publication types (Num. hits)
article(27) inproceedings(35) phdthesis(1) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 8 occurrences of 7 keywords

Results
Found 64 publication records. Showing 64 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Andreas Maletti, Daniel Quernheim Optimal Hyper-Minimization. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Ésik, Andreas Maletti The Category of Simulations for Weighted Tree Automata. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frank Drewes, Johanna Högberg, Andreas Maletti MAT learners for tree series: an abstract data type and two realizations. Search on Bibsonomy Acta Inf. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Fülöp, Andreas Maletti, Heiko Vogler Weighted Extended Tree Transducers. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Survey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Maletti, Daniel Quernheim Optimal Hyper-Minimization Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Pawel Gawrychowski, Artur Jez, Andreas Maletti On minimising automata with errors Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Andreas Maletti An alternative to synchronous tree substitution grammars. Search on Bibsonomy Natural Language Engineering The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Tree Transformations and Dependencies. Search on Bibsonomy MOL The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Maletti How to train your multi bottom-up tree transducer. Search on Bibsonomy ACL The full citation details ... 2011 DBLP  BibTeX  RDF
1Andreas Maletti, Daniel Quernheim Pushing for Weighted Tree Automata. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pawel Gawrychowski, Artur Jez, Andreas Maletti On Minimising Automata with Errors. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matthieu Constant, Andreas Maletti, Agata Savary (eds.) Finite-State Methods and Natural Language Processing, 9th International Workshop, FSMNLP 2010, Bois, France, July 12-16, 2011 Search on Bibsonomy FSMNLP The full citation details ... 2011 DBLP  BibTeX  RDF
1Aurélie Lagoutte, Andreas Maletti Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition. Search on Bibsonomy Algebraic Foundations in Computer Science The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Maletti, Daniel Quernheim Hyper-minimisation of deterministic weighted finite automata over semifields. Search on Bibsonomy AFL The full citation details ... 2011 DBLP  BibTeX  RDF
1Andreas Maletti Notes on Hyper-minimization. Search on Bibsonomy AFL The full citation details ... 2011 DBLP  BibTeX  RDF
1Artur Jez, Andreas Maletti Computing All ℓ-Cover Automata Fast. Search on Bibsonomy CIAA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Andreas Maletti An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Maletti, Catalin Ionut Tîrnauca Properties of Quasi-Relabeling Tree Bimorphisms. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zoltán Ésik, Andreas Maletti Simulation vs. Equivalence Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Zoltán Ésik, Andreas Maletti Simulations of Weighted Tree Automata Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Andreas Maletti Why Synchronous Tree Substitution Grammars? Search on Bibsonomy HLT-NAACL The full citation details ... 2010 DBLP  BibTeX  RDF
1Andreas Maletti A Tree Transducer Model for Synchronous Tree-Adjoining Grammars. Search on Bibsonomy ACL The full citation details ... 2010 DBLP  BibTeX  RDF
1Andreas Maletti Input Products for Weighted Extended Top-Down Tree Transducers. Search on Bibsonomy Developments in Language Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zoltán Ésik, Andreas Maletti Simulation vs. Equivalence. Search on Bibsonomy FCS The full citation details ... 2010 DBLP  BibTeX  RDF
1Andreas Maletti Survey: Tree Transducers in Machine Translation. Search on Bibsonomy NCMA The full citation details ... 2010 DBLP  BibTeX  RDF
1Zoltán Ésik, Andreas Maletti Simulations of Weighted Tree Automata. Search on Bibsonomy CIAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Better Hyper-minimization - Not as Fast, But Fewer Errors. Search on Bibsonomy CIAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Johanna Högberg, Andreas Maletti, Jonathan May Backward and forward bisimulation minimization of tree automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joost Engelfriet, Eric Lilin, Andreas Maletti Extended multi bottom-up tree transducers. Search on Bibsonomy Acta Inf. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Minimizing deterministic weighted tree automata. Search on Bibsonomy Inf. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Johanna Högberg, Andreas Maletti, Heiko Vogler Bisimulation Minimisation of Weighted Automata on Unranked Trees. Search on Bibsonomy Fundam. Inform. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Maletti, Catalin Ionut Tîrnauca Properties of quasi-alphabetic tree bimorphisms Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Zoltán Fülöp, Andreas Maletti, Heiko Vogler A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Recognizable tree series, Rational tree series, Multioperator monoids, Semirings
1Andreas Maletti, Jonathan Graehl, Mark Hopkins, Kevin Knight The Power of Extended Top-Down Tree Transducers. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Maletti, Giorgio Satta Parsing Algorithms based on Tree Automata. Search on Bibsonomy IWPT The full citation details ... 2009 DBLP  BibTeX  RDF
1Andreas Maletti A Backward and a Forward Simulation for Weighted Tree Automata. Search on Bibsonomy CAI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Maletti, Catalin Ionut Tîrnauca Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. Search on Bibsonomy CAI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF tree bimorphism, natural language processing, syntax-directed translation, regular tree language
1Andreas Maletti Minimizing Weighted Tree Grammars Using Simulation. Search on Bibsonomy FSMNLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Maletti, Heiko Vogler Compositions of Top-Down Tree Transducers with epsilon-Rules. Search on Bibsonomy FSMNLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Andreas Maletti An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. Search on Bibsonomy CIAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Compositions of extended top-down tree transducers. Search on Bibsonomy Inf. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Minimizing Deterministic Weighted Tree Automata. Search on Bibsonomy LATA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Myhill-Nerode Theorem for Recognizable Tree Series Revisited. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Joost Engelfriet, Eric Lilin, Andreas Maletti Extended Multi Bottom-Up Tree Transducers. Search on Bibsonomy Developments in Language Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Tree-Series-to-Tree-Series Transformations. Search on Bibsonomy CIAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Pure and O-Substitution. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Learning Deterministically Recognizable Tree Series - Revisited. Search on Bibsonomy CAI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Compositions of Extended Top-down Tree Transducers. Search on Bibsonomy LATA The full citation details ... 2007 DBLP  BibTeX  RDF
1Johanna Högberg, Andreas Maletti, Jonathan May Bisimulation Minimisation for Weighted Tree Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Johanna Högberg, Andreas Maletti, Jonathan May Backward and Forward Bisimulation Minimisation of Tree Automata. Search on Bibsonomy CIAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF natural language processing, bisimulation, minimisation, tree automata
1Andreas Maletti The power of tree series transducers. Search on Bibsonomy 2006   RDF
1Andreas Maletti Compositions of tree series transformations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Björn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic, Heiko Vogler Cut sets as recognizable tree languages. Search on Bibsonomy Fuzzy Sets and Systems The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Armin Kühnemann, Andreas Maletti The Substitution Vanishes. Search on Bibsonomy AMAST The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Hierarchies of Tree Series Transformations Revisited. Search on Bibsonomy Developments in Language Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Does o-Substitution Preserve Recognizability? Search on Bibsonomy CIAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andreas Maletti HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Relating tree series transducers and weighted tree automata. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti Bounds for Tree Automata with Polynomial Costs. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2005 DBLP  BibTeX  RDF
1Andreas Maletti, Heiko Vogler Incomparability Results for Classes of Polynomial Tree Series Transformations. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2005 DBLP  BibTeX  RDF
1Andreas Maletti The Power of Tree Series Transducers of Type I and II. Search on Bibsonomy Developments in Language Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Relating Tree Series Transducers and Weighted Tree Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Maletti Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. Search on Bibsonomy CIAA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #64 of 64 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.