2 papers
cs.FL2026
Complementing Emerson-Lei Elevator Automata (Technical Report)
Ondrej Alexaj, VojtÄch Havlena, OndÅej Lengál +2
Büchi elevator automata naturally appear in several areas of formal methods as a structural expressibly-equivalent subclass of Büchi automata where every strongly connected compo…
cs.LO2026
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…