Detail publikačního výsledku

Simulations and Antichains for Efficient Handling of Finite Automata

HOLÍK, L.

Originální název

Simulations and Antichains for Efficient Handling of Finite Automata

Anglický název

Simulations and Antichains for Efficient Handling of Finite Automata

Druh

Dizertace

Klíčová slova

Finite automata, finite tree automata, alternating Büchi automata, nondeterminism,
simulation, bisimulation, universality, language inclusion, antichain,
quotienting, regular tree model checking.

Klíčová slova v angličtině

Finite automata, finite tree automata, alternating Büchi automata, nondeterminism,
simulation, bisimulation, universality, language inclusion, antichain,
quotienting, regular tree model checking.

Autoři

HOLÍK, L.

Vydáno

18.03.2011

Nakladatel

Department of Intelligent Systems FIT BUT

Místo

Brno

Strany počet

128

URL

https://www.fit.vut.cz/research/publication/9517/

BibTex

@misc{BUT192737,
  author="Lukáš {Holík}",
  title="Simulations and Antichains for Efficient Handling of Finite Automata",
  year="2011",
  pages="128",
  publisher="Department of Intelligent Systems FIT BUT",
  address="Brno",
  url="https://www.fit.vut.cz/research/publication/9517/"
}

Dokumenty

phdthesis