50 search results - page 1 / 10 » Regular Languages Are Testable with a Constant Number of Que... |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
JIIS
2008
13 years 4 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
ECCC
2011
12 years 8 months ago
2011
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...