Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 DBLP:journals/siamcomp/AlonKNS00
%A Alon, Noga
%A Krivelevich, Michael
%A Newman, Ilan
%A Szegedy, Mario
%D 2000
%J SIAM J. Comput.
%K property-testing
%N 6
%P 1842-1862
%R 10.1137/S0097539700366528
%T Regular Languages are Testable with a Constant Number of
Queries
%V 30
@article{DBLP:journals/siamcomp/AlonKNS00,
added-at = {2012-01-20T23:10:39.000+0100},
author = {Alon, Noga and Krivelevich, Michael and Newman, Ilan and Szegedy, Mario},
bibsource = {DBLP, http://dblp.uni-trier.de},
biburl = {https://www.bibsonomy.org/bibtex/279483cab5d8870a5662b3e5aec518b1f/ytyoun},
doi = {10.1137/S0097539700366528},
interhash = {9d8ba8de8fe527068b55e93da0096e0f},
intrahash = {79483cab5d8870a5662b3e5aec518b1f},
journal = {SIAM J. Comput.},
keywords = {property-testing},
number = 6,
pages = {1842-1862},
timestamp = {2015-12-13T10:19:22.000+0100},
title = {Regular Languages are Testable with a Constant Number of
Queries},
volume = 30,
year = 2000
}