28 search results - page 3 / 6 » Bisimulation Minimization of Tree Automata |
FCT
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
WIA
2007
Springer
14 years 1 months ago
2007
Springer
WIA
2009
Springer
13 years 12 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...