1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.LO2023★ 1 cited
Z3-Noodler: An Automata-based String Solver (Technical Report)
Yu-Fang Chen, David Chocholatý, Vojtěch Havlena +3
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…
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.FL2023★ 1 cited
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…