Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Turoňová, Lenka"'
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 bounds, has been an open problem for at least two decades. We show tha
Externí odkaz:
http://arxiv.org/abs/2301.12851
Autor:
Holík, Lukáš, Lengál, Ondřej, Saarikivi, Olli, Turoňová, Lenka, Veanes, Margus, Vojnar, Tomáš
We propose an efficient algorithm for determinising counting automata (CAs), i.e., finite automata extended with bounded counters. The algorithm avoids unfolding counters into control states, unlike the na\"ive approach, and thus produces much smalle
Externí odkaz:
http://arxiv.org/abs/1910.01996
Autor:
Turoňová, Lenka
This work is focusing on automatic verification of systems with parallel running processes. We discuss the existing methods and certain possibilities of optimizing them. Existing techniques are essentially based on finding an inductive invariant (for
Externí odkaz:
http://www.nusl.cz/ntk/nusl-234903
Autor:
Turoňová, Lenka, Kubejová, Kristína, Vorčáková, Karolína, Ďurdík, Peter, Péčová, Tatiana, Martinásková, Klára
Publikováno v:
Acta Medica; 2018, Vol. 61 Issue 3, p79-85, 7p
