Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Holík, Lukáš"'
Autor:
Šedý, Michal, Holík, Lukáš
We introduce a novel paradigm for reducing the size of finite automata by compressing repeating sub-graphs. These repeating sub-graphs can be viewed as invocations of a single procedure. Instead of representing each invocation explicitly, they can be
Externí odkaz:
http://arxiv.org/abs/2410.20227
Autor:
Abdulla, Parosh Aziz, Chen, Yo-Ga, Chen, Yu-Fang, Holík, Lukáš, Lengál, Ondřej, Lin, Jyun-Ao, Lo, Fang-Yi, Tsai, Wei-Lun
We present a new method for the verification of quantum circuits based on a novel symbolic representation of sets of quantum states using level-synchronized tree automata (LSTAs). LSTAs extend classical tree automata by labeling each transition with
Externí odkaz:
http://arxiv.org/abs/2410.18540
We present a new angle on solving quantified linear integer arithmetic based on combining the automata-based approach, where numbers are understood as bitvectors, with ideas from (nowadays prevalent) algebraic approaches, which work directly with num
Externí odkaz:
http://arxiv.org/abs/2403.18995
Autor:
Chocholatý, David, Fiedor, Tomáš, Havlena, Vojtěch, Holík, Lukáš, Hruška, Martin, Lengál, Ondřej, Síč, Juraj
Mata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint solving and reasoning about regular expressions, and as a~reference imp
Externí odkaz:
http://arxiv.org/abs/2310.10136
Z3-Noodler is a fork of Z3 that replaces its string theory solver with a custom solver implementing the recently introduced stabilization-based algorithm for solving word equations with regular constraints. An extensive experimental evaluation shows
Externí odkaz:
http://arxiv.org/abs/2310.08327
Autor:
Holík, Lukáš, Šimáček, Jiří
Publikováno v:
Luk\'a\v{s} Hol\'ik and Ji\v{r}\'i \v{S}im\'a\v{c}ek, Optimizing an LTS-simulation algorithm. Computing and Informatics, 2010(7):1337-1348, 2010
When comparing the fastest algorithm for computing the largest simulation preorder over Kripke structures with the one for labeled transition systems (LTS), there is a noticeable time and space complexity blow-up proportional to the size of the alpha
Externí odkaz:
http://arxiv.org/abs/2307.04235
We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This problem is undecidable in general. Therefore, we propose a new decidable
Externí odkaz:
http://arxiv.org/abs/2307.03970
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 the context of analysing regular expressions and in string constraint
Externí odkaz:
http://arxiv.org/abs/2304.05064
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:
Blahoudek, František, Chen, Yu-Fang, Chocholatý, David, Havlena, Vojtěch, Holík, Lukáš, Lengál, Ondřej, Síč, Juraj
When eating spaghetti, one should have the sauce and noodles mixed instead of eating them separately. We argue that also in string solving, word equations and regular constraints are better mixed together than approached separately as in most current
Externí odkaz:
http://arxiv.org/abs/2212.02317