Publication Details

A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata

HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; KAATI, L. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. FIT-TR-2008-005, Brno: 2008. p. 0-0.
Czech title
Uniformní (bi-)simulační framework pro redukci stromových automtů
Type
report
Language
English
Authors
URL
Keywords

tree automata, bisimulation, simulation, size reduction, framework

Abstract

In this paper, we address the problem of reducing the size of non- deterministic (bottom-up) tree automata. We propose a uniform framework that allows for combining various upward and downward bisimulation and simulation relations in order to obtain a language-preserving combined relation suitable for reducing tree automata without a need to determinise them. The framework gen- eralises and improves several previous works and provides a broad spectrum of different relations yielding a possibility of a ?ne choice between the amount of re- duction and the computational demands. We analyse properties of the considered relations both theoretically as well as through a series of experiments.  

Published
2008
Pages
18
Place
FIT-TR-2008-005, Brno
BibTeX
@techreport{BUT63768,
  author="Lukáš {Holík} and Tomáš {Vojnar} and Parosh {Abdulla} and Lisa {Kaati}",
  title="A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata",
  year="2008",
  address="FIT-TR-2008-005, Brno",
  pages="18",
  url="http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2008-005.pdf"
}
Back to top