Sciweavers

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

14

IJFCS
2007

favoriteEmaildiscussreport

80views more IJFCS 2007»

Bisimulation Minimization of Tree Automata

13 years 4 months ago

Bisimulation Minimization of Tree Automata

Download user.it.uu.se

We extend an algorithm by Paige and Tarjan that solves the coarsest stable reﬁnement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of O(ˆÖ Ñ log Ò), where ˆÖ is the maximum rank of the input alphabet, Ñ is the total size of the transition table, and Ò is the number of states.

Parosh Aziz Abdulla, Johanna Högberg, Lisa Ka

Real-time Traffic

Algorithm | Coarsest Stable Reﬁnement | IJFCS 2007 | Non-deterministic Tree Automata |

claim paper

Related Content

» Backward and Forward Bisimulation Minimisation of Tree Automata

» Weighted Bisimulation in Linear Algebraic Form

» Fair Equivalence Relations

» On the minimization of XML Schemas and tree automata for unranked trees

» Minimizing Weighted Tree Grammars Using Simulation

» Minimization of Nondeterministic Automata with Large Alphabets

» State Space Reduction Techniques for Component Interfaces

» Minimizing Tree Automata for Unranked Trees

» Head Automata and Bilingual Tiling Translation with Minimal Representations

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	IJFCS
Authors	Parosh Aziz Abdulla, Johanna Högberg, Lisa Kaati

Comments (0)