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 条
  • [1] ON SEPARATION BY LOCALLY TESTABLE AND LOCALLY THRESHOLD TESTABLE LANGUAGES
    Place, Thomas
    Van Rooijen, Lorijn
    Zeitoun, Marc
    LOGICAL METHODS IN COMPUTER SCIENCE, 2014, 10 (03)
  • [2] ON GENERALIZED LOCALLY TESTABLE LANGUAGES
    BRZOZOWSKI, JA
    FICH, FE
    DISCRETE MATHEMATICS, 1984, 50 (2-3) : 153 - 169
  • [3] Bilateral locally testable languages
    García, P
    Ruiz, J
    de Parga, MV
    THEORETICAL COMPUTER SCIENCE, 2003, 299 (1-3) : 775 - 783
  • [4] Right and left locally testable languages
    García, P
    Ruiz, J
    THEORETICAL COMPUTER SCIENCE, 2000, 246 (1-2) : 253 - 264
  • [5] Measuring Power of Locally Testable Languages
    Sin'ya, Ryoma
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2022), 2022, 13257 : 274 - 285
  • [6] A Decidable Characterization of Locally Testable Tree Languages
    Place, Thomas
    Segoufin, Luc
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS, 2009, 5556 : 285 - +
  • [7] From Regular to Strictly Locally Testable Languages
    Reghizzi, Stefano Crespi
    San Pietro, Pierluigi
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 103 - 111
  • [8] Splicing representations of strictly locally testable languages
    Head, T
    DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 139 - 147
  • [9] FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES
    Reghizzi, Stefano Crespi
    San Pietro, Pierluigi
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (08) : 1711 - 1727
  • [10] A DECIDABLE CHARACTERIZATION OF LOCALLY TESTABLE TREE LANGUAGES
    Place, Thomas
    Segoufin, Luc
    LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (04) : 10 - 25
12345