3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.FL2023
Reasoning about Regular Properties: A Comparative Study
Tomáš Fiedor, Lukáš Holík, Martin Hruška +3
Several new algorithms for deciding emptiness of Boolean combinations of regular languages and of languages of alternating automata (AFA) have been proposed recently, especially in…
cs.PF2022
Perun: Performance Version System
Tomáš Fiedor, Jiří Pavela, Adam Rogalewicz +1
In this paper, we present Perun: an open-source tool suite for profiling-based performance analysis. At its core, Perun maintains links between project versions and the correspondi…
cs.LO2015★ 3 cited
Nested Antichains for WS1S
Tomas Fiedor, Lukas Holik, Ondrej Lengal +1
We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within t…