3 citations · 16 across the 22 of their papers we have counts for
3 papers · 1 filter
Word Equations in Synergy with Regular Constraints (Technical Report)
František Blahoudek, Yu-Fang Chen, David Chocholatý +4
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 a…
Complementing Büchi Automata with Ranker (Technical Report)
Vojtěch Havlena, Ondřej Lengál, Barbora Šmahlíková
We present the tool Ranker for complementing Büchi automata (BAs). Ranker builds on our previous optimizations of rank-based BA complementation and pushes them even further using n…
Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
Vojtěch Havlena, Lukáš Holík, Ondřej Lengál +2
Matching regexes (regular expressions) is a common problem in many areas of computer science, with requirements on high speed and robust performance. Regexes with backreferences al…