Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CAI
2009
Springer

favoriteEmaildiscussreport

136views Information Technology» more CAI 2009»

A Backward and a Forward Simulation for Weighted Tree Automata

13 years 11 months ago

A Backward and a Forward Simulation for Weighted Tree Automata

Download wwwtcs.inf.tu-dresden.de

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 types of simulations work for wta over additively idempotent, commutative semirings and can be used to reduce the size of wta while preserving their semantics. Such reductions are an important tool in automata toolkits.

Andreas Maletti

Real-time Traffic

CAI 2009 | Informatics | Simulations | Weighted Tree Automata | Wta Process Trees |

claim paper

Related Content

» Simulations of Weighted Tree Automata

» Backward and Forward Bisimulation Minimisation of Tree Automata

» Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order

» Efficient Inference through Cascades of Weighted Tree Transducers

» Alternationfree modal mucalculus for data trees

» Perfect Simulation of Stochastic Automata Networks

» On Tree Automata that Certify Termination of LeftLinear Term Rewriting Systems

» Minimization of tree pattern queries with constraints

» A Balanced TreeBased Strategy for Unstructured Media Distribution in P2P Networks

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CAI
Authors	Andreas Maletti

Comments (0)