Sciweavers

Share
6 search results - page 1 / 2
» Backward and Forward Bisimulation Minimisation of Tree Autom...
Sort
View
WIA
2007
Springer
9 years 7 months ago
Backward and Forward Bisimulation Minimisation of Tree Automata
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
Johanna Högberg, Andreas Maletti, Jonathan Ma...
CAI
2009
Springer
9 years 8 months ago
A Backward and a Forward Simulation for Weighted Tree Automata
Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring. The two type...
Andreas Maletti
CORR
2010
Springer
91views Education» more  CORR 2010»
9 years 1 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti
LICS
2007
IEEE
9 years 7 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
ACL
2010
8 years 11 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
books