39 citations · 57 across the 13 of their papers we have counts for
5 papers · 1 filter
On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
Lukáš Holík, Ondřej Lengál, Juraj Major +2
Complementation of finite automata is a basic operation used in numerous applications. The standard way to complement a nondeterministic finite automaton (NFA) is to transform it i…
LTL to Smaller Self-Loop Alternating Automata and Back
František Blahoudek, Juraj Major, Jan Strejček
Self-loop alternating automata (SLAA) with Büchi or co-Büchi acceptance are popular intermediate formalisms in translations of LTL to deterministic or nondeterministic automata. Th…
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
Tomáš Babiak, František Blahoudek, Mojmír Křetínský +1
Some applications of linear temporal logic (LTL) require to translate formulae of the logic to deterministic omega-automata. There are currently two translators producing determini…
LTL to Büchi Automata Translation: Fast and More Deterministic
Tomáš Babiak, Mojmír Křetínský, Vojtěch Řehák +1
We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae into Büchi automata via very weak alternating co-Büchi automata and generalized Büchi autom…
Almost Linear Büchi Automata
Tomáš Babiak, Vojtěch Řehák, Jan Strejček
We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Buechi automata (BA) called Almost linear Buechi automata (ALBA). We provide effective tran…