4 citations · 10 across the 14 of their papers we have counts for
9 papers · 1 filter
String Solving with Stabilization and Transducers (Technical Report)
David Chocholatý, Vojtěch Havlena, Lukáš Holík +2
We generalize an efficient automata-based approach to string constraint solving, the stabilization-based method behind the solver Z3-Noodler, to support relational constraints repr…
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…
Automata Size Reduction by Procedure Finding
Michal Šedý, Lukáš Holík
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 proc…
Mata, a Fast and Simple Finite Automata Library (Technical Report)
David Chocholatý, Tomáš Fiedor, Vojtěch Havlena +4
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 s…
Optimizing an LTS-Simulation Algorithm (Technical Report)
Lukáš Holík, Jiří Šimáček
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 t…
Chain-Free String Constraints (Technical Report)
Parosh Aziz Abdulla, Mohamed Faouzi Atig Bui Phi Diep, Lukáš Holík +1
We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This pro…