activity
20162026
most citedConcatenation Operations and Restricted Variants of Two-Dimensional Automata

2 citations · 4 across the 10 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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…