Families of locally testable languages

被引：16
|
作者：
Caron, P [1 ]
机构：
[1] Univ Rouen, Lab Informat Fondamentale & Appl Rouen, F-76821 Mt St Aignan, France
来源：
THEORETICAL COMPUTER SCIENCE | 2000年 / 242卷 / 1-2期
关键词：
algorithms; automata; locally testable languages; regular languages;
D O I：
10.1016/S0304-3975(98)00332-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 languages, two subclasses of locally testable languages. These two characterizations lead us to polynomial time algorithms for testing these families of languages. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：361 / 376
页数：16
相关论文
共 50 条
  • [31] Locally testable cyclic codes
    Babai, L
    Shpilka, A
    Stefankovic, D
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (08) : 2849 - 2858
  • [32] Tolerant locally testable codes
    Guruswami, V
    Rudra, A
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 306 - 317
  • [33] Locally testable cyclic codes
    Babai, L
    Shpilka, A
    Stefankovic, D
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 116 - 125
  • [34] QUANTUM LOCALLY TESTABLE CODES
    Aharonov, Dorit
    Eldar, Lior
    SIAM JOURNAL ON COMPUTING, 2015, 44 (05) : 1230 - 1262
  • [35] The Boolean Algebra of Piecewise Testable Languages
    Konovalov, Anton
    Selivanov, Victor
    PURSUIT OF THE UNIVERSAL, 2016, 9709 : 292 - 301
  • [36] Locally Testable vs. Locally Decodable Codes
    Kaufman, Tali
    Viderman, Michael
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 670 - +
  • [37] COMBINATORIAL CONSTRUCTION OF LOCALLY TESTABLE CODES
    Meir, Or
    SIAM JOURNAL ON COMPUTING, 2009, 39 (02) : 491 - 544
  • [38] Combinatorial Construction of Locally Testable Codes
    Meir, Or
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 285 - 294
  • [39] COMPUTING THE ORDER OF A LOCALLY TESTABLE AUTOMATON
    KIM, S
    MCNAUGHTON, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 560 : 186 - 211
  • [40] Short locally testable codes and proofs
    Goldreich O.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6650 LNCS : 333 - 372
12345