The SCEAS System
| |||||||

## Search the dblp DataBase
Andreas Maletti:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Armin Kühnemann, Andreas Maletti
**The Substitution Vanishes.**[Citation Graph (0, 0)][DBLP] AMAST, 2006, pp:173-188 [Conf] - Andreas Maletti
**Relating Tree Series Transducers and Weighted Tree Automata.**[Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2004, pp:321-333 [Conf] - Andreas Maletti
**The Power of Tree Series Transducers of Type I and II.**[Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2005, pp:338-349 [Conf] - Andreas Maletti
**Hierarchies of Tree Series Transformations Revisited.**[Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2006, pp:215-225 [Conf] - Andreas Maletti
**Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids.**[Citation Graph (0, 0)][DBLP] CIAA, 2004, pp:323-324 [Conf] - Andreas Maletti
**Does o-Substitution Preserve Recognizability?**[Citation Graph (0, 0)][DBLP] CIAA, 2006, pp:150-161 [Conf] - Björn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic, Heiko Vogler
**Cut sets as recognizable tree languages.**[Citation Graph (0, 0)][DBLP] Fuzzy Sets and Systems, 2006, v:157, n:11, pp:1560-1571 [Journal] - Andreas Maletti
**Relating tree series transducers and weighted tree automata.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:723-741 [Journal] - Andreas Maletti
**HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:339, n:2-3, pp:200-240 [Journal] - Andreas Maletti
**Compositions of tree series transformations.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:366, n:3, pp:248-271 [Journal] - Johanna Högberg, Andreas Maletti, Jonathan May
**Bisimulation Minimisation for Weighted Tree Automata.**[Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2007, pp:229-241 [Conf] - Johanna Högberg, Andreas Maletti, Jonathan May
**Backward and Forward Bisimulation Minimisation of Tree Automata.**[Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:109-121 [Conf] **Extended Multi Bottom-Up Tree Transducers.**[Citation Graph (, )][DBLP]**Input Products for Weighted Extended Top-Down Tree Transducers.**[Citation Graph (, )][DBLP]**Parsing Algorithms based on Tree Automata.**[Citation Graph (, )][DBLP]**Myhill-Nerode Theorem for Recognizable Tree Series Revisited.**[Citation Graph (, )][DBLP]**Tree-Series-to-Tree-Series Transformations.**[Citation Graph (, )][DBLP]**An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.**[Citation Graph (, )][DBLP]**Minimizing Weighted Tree Grammars Using Simulation.**[Citation Graph (, )][DBLP]**Compositions of Top-Down Tree Transducers with**[Citation Graph (, )][DBLP]*epsilon*-Rules.**Learning Deterministically Recognizable Tree Series - Revisited.**[Citation Graph (, )][DBLP]**A Backward and a Forward Simulation for Weighted Tree Automata.**[Citation Graph (, )][DBLP]**Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited.**[Citation Graph (, )][DBLP]**Minimizing Deterministic Weighted Tree Automata.**[Citation Graph (, )][DBLP]**Extended multi bottom-up tree transducers.**[Citation Graph (, )][DBLP]**Properties of quasi-alphabetic tree bimorphisms**[Citation Graph (, )][DBLP]**Simulation vs. Equivalence**[Citation Graph (, )][DBLP]**Simulations of Weighted Tree Automata**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |