Sciweavers

Share
13 search results - page 1 / 3
» A Backward and a Forward Simulation for Weighted Tree Automa...
Sort
View
CAI
2009
Springer
11 years 12 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»
11 years 5 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
WIA
2007
Springer
11 years 11 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...
RP
2009
Springer
124views Control Systems» more  RP 2009»
11 years 12 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez
ACL
2010
11 years 3 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