6 search results - page 1 / 2 » Backward and Forward Bisimulation Minimisation of Tree Autom... |
WIA
2007
Springer
13 years 10 months ago
2007
Springer
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
CAI
2009
Springer
13 years 11 months ago
2009
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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...
LICS
2007
IEEE
13 years 10 months ago
2007
IEEE
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 ...
ACL
2010
13 years 2 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...