3 citations · 4 across the 4 of their papers we have counts for
4 papers
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…
Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report)
Lukáš Holík, Juraj Síč, Lenka Turoňová +1
Fast matching of regular expressions with bounded repetition, aka counting, such as (ab){50,100}, i.e., matching linear in the length of the text and independent of the repetition…
Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
Jan Bouda, Lukáš Holík, Jan Kofroň +2
MEMICS provides a forum for doctoral students interested in applications of mathematical and engineering methods in computer science. Besides a rich technical programme (including…
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…