๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Combinatorial Construction of Locally Testable Codes

โœ Scribed by Meir, Or

Book ID
118181055
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
597 KB
Volume
39
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Locally testable cyclic codes
Locally testable cyclic codes
โœ Babai, L.; Shpilka, A.; Stefankovic, D. ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› IEEE ๐ŸŒ English โš– 360 KB
Locally Testable Codes Require Redundant
Locally Testable Codes Require Redundant Testers
โœ Ben-Sasson, Eli; Guruswami, Venkatesan; Kaufman, Tali; Sudan, Madhu; Viderman, M ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 277 KB
Families of locally testable languages
Families of locally testable languages
โœ Pascal Caron ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

## Kim, McNaughton and McCloskey have produced a polynomial time algorithm in order to test if a deterministic automaton recognizes a locally testable language. We provide a characterization in terms of automata for the strictly locally testable languages and for the strongly locally testable lang