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