2 citations · 4 across the 10 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.FL2024
Illustrating Finite Automata with Grail+ and TikZ
Alastair May, Taylor J. Smith
In this article, we discuss a new software tool that interacts with Grail+, a library of automata-theoretic command-line utilities. Our software, the Grail+ Visualizer, takes the t…
cs.DS2024
Improved Randomized Approximation of Hard Universality and Emptiness Problems
Pantelis Andreou, Stavros Konstantinidis, Taylor J. Smith
We build on recent research on polynomial randomized approximation (PRAX) algorithms for the hard problems of NFA universality and NFA equivalence. Loosely speaking, PRAX algorithm…