Improved Randomized Approximation of Hard Universality and Emptiness Problems
<|reference_start|>Improved Randomized Approximation of Hard Universality and Emptiness Problems: We build on recent research on polynomial randomized approximation (PRAX) algorithms for the hard problems of NFA universality and NFA equivalence. Loosely speaking, PRAX algorithms use sampling of infinite domains within any desired accuracy $\delta$. In the spirit of experimental mathematics, we extend the concept of PRAX algorithms to be applicable to the emptiness and universality problems in any domain whose instances admit a tractable distribution as defined in this paper. A technical result here is that a linear (w.r.t. $1/\delta$) number of samples is sufficient, as opposed to the quadratic number of samples in previous papers. We show how the improved and generalized PRAX algorithms apply to universality and emptiness problems in various domains: ordinary automata, tautology testing of propositions, 2D automata, and to solution sets of certain Diophantine equations.<|reference_end|>
@article{andreou2024improved,
    title={Improved Randomized Approximation of Hard Universality and Emptiness
  Problems},
    author={Pantelis Andreou, Stavros Konstantinidis, Taylor J. Smith},
    journal={arXiv preprint arXiv:2403.08707},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.08707},
    primaryClass={cs.DS cs.FL}
}