VOLUME 30 2025 NUMBERS 1–3
Improved Randomized Approximation of Hard Universality and Emptiness Problems
Pantelis Andreou, Stavros Konstantinidis , Taylor J. Smith 
Pages 5–26



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2025-005,
  author  = {},
  title   = {Improved Randomized Approximation of Hard Universality and Emptiness Problems},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {30},
  number  = {1--3},
  pages   = {5--26},
  year    = {2025},
  url     = {https://doi.org/10.25596/jalc-2025-005},
  doi     = {10.25596/jalc-2025-005}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: approximation, Diophantine equations, emptiness problems, nondeterministic finite automata, randomization, tautology testing, two-dimensional automata, universality problems
DOI: 10.25596/jalc-2025-005