Rational series and their languages
Rational series and their languages
Iteration theories: the equational logic of iterative processes
Iteration theories: the equational logic of iterative processes
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata, Languages, and Machines
Automata, Languages, and Machines
Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An extension theorem with an application to formal tree series
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Continuous monoids and semirings
Theoretical Computer Science - Logic, semantics and theory of programming
Bisimulation relations for weighted automata
Theoretical Computer Science
Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Bisimulation minimisation for weighted tree automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Conjugacy and equivalence of weighted automata and functional transducers
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On the equivalence of Z-automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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 forward and backward simulations. In addition, it is shown in several cases (fields, commutative rings, NOETHERIAN semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations. More precisely, in all mentioned cases there is a single wta that simulates both M and N. Those results immediately yield decidability of equivalence provided that the semiring is finitely (and effectively) presented.