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 条
  • [21] A CHARACTERIZATION OF STRICTLY LOCALLY TESTABLE LANGUAGES AND ITS APPLICATION TO SUBSEMIGROUPS OF A FREE SEMIGROUP
    DELUCA, A
    RESTIVO, A
    INFORMATION AND CONTROL, 1980, 44 (03): : 300 - 319
  • [22] Over testable languages
    Universite de Paris, Paris, France
    Theor Comput Sci, 1-2 (157-190):
  • [23] Over testable languages
    Selmi, C
    THEORETICAL COMPUTER SCIENCE, 1996, 161 (1-2) : 157 - 190
  • [24] Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
    Truthe, Bianca
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, 386 : 253 - 268
  • [25] Hierarchies of Piecewise Testable Languages
    Klima, Ondrej
    Polak, Libor
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 479 - 490
  • [26] Piecewise testable tree languages
    Bojanczyk, Mikolaj
    Segoufin, Luc
    Straubing, Howard
    TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 442 - +
  • [27] PIECEWISE TESTABLE TREE LANGUAGES
    Bojanczyk, Mikolaj
    Segoufin, Luc
    Straubing, Howard
    LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (03)
  • [28] HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES
    Klima, Ondrej
    Polak, Libor
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (04) : 517 - 533
  • [29] Separating Regular Languages by Piecewise Testable and Unambiguous Languages
    Place, Thomas
    van Rooijen, Lorijn
    Zeitoun, Marc
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 729 - 740
  • [30] Identities of locally testable semigroups
    Trahtman, AN
    COMMUNICATIONS IN ALGEBRA, 1999, 27 (11) : 5405 - 5412
12345