Showing cs.FLShow all
2 papers · 1 filter
cs.FL2025
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
Shuanglong Kan, Anthony W. Lin
Finite Automata (FAs) are fundamental components in the domains of programming languages. For instance, regular expressions, which are pivotal in languages such as JavaScript and P…
cs.FL2024
Parikh's Theorem Made Symbolic
Matthew Hague, Artur Jeż, Anthony W. Lin
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constrai…