National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Efficient Algorithms for Tree Automata
Valeš, Ondřej ; Hruška, Martin (referee) ; Lengál, Ondřej (advisor)
In this work a novel algorithm for testing language equivalence and inclusion on tree automata is proposed and implemented as a module in the VATA library. First, existing approaches to equivalence and inclusion testing on both word and tree automata are examined. These existing approaches are then modified to create bisimulation up-to congruence algorithm for tree automata and a formal proof of the soundness of the new algorithm is provided. Efficiency of this new approach is compared with existing language equivalence and inclusion testing methods for tree automata, showing the performance of our algorithm on hard cases is often superior.
Efficient Algorithms for Tree Automata
Valeš, Ondřej ; Hruška, Martin (referee) ; Lengál, Ondřej (advisor)
In this work a novel algorithm for testing language equivalence and inclusion on tree automata is proposed and implemented as a module in the VATA library. First, existing approaches to equivalence and inclusion testing on both word and tree automata are examined. These existing approaches are then modified to create bisimulation up-to congruence algorithm for tree automata and a formal proof of the soundness of the new algorithm is provided. Efficiency of this new approach is compared with existing language equivalence and inclusion testing methods for tree automata, showing the performance of our algorithm on hard cases is often superior.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.