4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.FL2023★ 1 cited
Symbolic Automata: -Regularity Modulo Theories
Margus Veanes, Thomas Ball, Gabriel Ebner +1
Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions/languages ove…
cs.FL2023★ 4 cited
Derivative Based Extended Regular Expression Matching Supporting Intersection, Complement and Lookarounds
Ian Erik Varatalu, Margus Veanes, Juhan-Peep Ernits
Regular expressions are widely used in software. Various regular expression engines support different combinations of extensions to classical regular constructs such as Kleene star…