Detail publikace

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

HOLÍK, L. VOJNAR, T. ABDULLA, P. KAATI, L.

Originální název

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

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

tree automata, bisimulation, simulation, size reduction, framework

Autoři

HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; KAATI, L.

Rok RIV

2008

Vydáno

3. 12. 2008

Nakladatel

Faculty of Informatics MU

Místo

Brno

ISBN

978-80-7355-082-0

Kniha

4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

Strany od

3

Strany do

11

Strany počet

9

BibTex

@inproceedings{BUT33442,
  author="Lukáš {Holík} and Tomáš {Vojnar} and Parosh {Abdulla} and Lisa {Kaati}",
  title="A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata",
  booktitle="4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  year="2008",
  pages="3--11",
  publisher="Faculty of Informatics MU",
  address="Brno",
  isbn="978-80-7355-082-0"
}