Regular Languages are Testable with a Constant Number of Queries

@article{Alon2000RegularLA,
  title={Regular Languages are Testable with a Constant Number of Queries},
  author={Noga Alon and Michael Krivelevich and Ilan Newman and Mario Szegedy},
  journal={SIAM J. Comput.},
  year={2000},
  volume={30},
  pages={1842-1862}
}
Highly Influential
This paper has highly influenced 17 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
108 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 108 extracted citations

Similar Papers

Loading similar papers…