163 citations · 504 across the 20 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
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.FL2019
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report)
Lukáš Holík, Ondřej Lengál, Olli Saarikivi +3
We propose an efficient algorithm for determinising counting automata (CAs), i.e., finite automata extended with bounded counters. The algorithm avoids unfolding counters into cont…