A new algorithm for testing if a regular language is locally threshold testable

被引：5
|
作者：
Bojanczyk, Mikolaj [1 ]
机构：
[1] Univ Warsaw, Inst Informat, PL-00325 Warsaw, Poland
来源：
INFORMATION PROCESSING LETTERS | 2007年 / 104卷 / 03期
关键词：
formal languages;
D O I：
10.1016/j.ipl.2007.05.015
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is shorter. The proof idea is to restate the problem in Presburger arithmetic. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：91 / 94
页数：4
相关论文
共 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] From Regular to Strictly Locally Testable Languages
    Reghizzi, Stefano Crespi
    San Pietro, Pierluigi
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 103 - 111
  • [3] 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
  • [4] ON FREE SPECTRA OF VARIETIES OF LOCALLY THRESHOLD TESTABLE SEMIGROUPS
    Dolinka, Igor
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2012, 22 (06)
  • [5] Tolerant Linearity Testing and Locally Testable Codes
    Kopparty, Swastik
    Saraf, Shubhangi
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2009, 5687 : 601 - +
  • [6] REGULAR LOCALLY TESTABLE SEMIGROUPS AS SEMIGROUPS OF QUASI-IDEALS
    PASTIJN, F
    ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1980, 36 (1-2): : 161 - 166
  • [7] A NEW EFFICIENT AND FLEXIBLE ALGORITHM FOR THE DESIGN OF TESTABLE SUBSYSTEMS
    Ploix, Stephane
    Yassine, Abed Alrahim
    Flaus, Jean-Marie
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2010, 20 (01) : 175 - 190
  • [8] AN ALGORITHM FOR CONSTRUCTING A BASE IN A LANGUAGE OF REGULAR EXPRESSIONS
    MIRKIN, BG
    ENGINEERING CYBERNETICS, 1966, (05): : 110 - &
  • [9] A New SITA Perimetric Threshold Testing Algorithm: Construction and a Multicenter Clinical Study
    Heijl, Anders
    Patella, Vincent Michael
    Chong, Luke X.
    Iwase, Aiko
    Leung, Christopher K.
    Tuulonen, Anja
    Lee, Gary C.
    Callan, Thomas
    Bengtsson, Boel
    AMERICAN JOURNAL OF OPHTHALMOLOGY, 2019, 198 : 154 - 165
  • [10] Testing extended regular language membership incrementally by rewriting
    Rosu, G
    Viswanathan, M
    REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2003, 2706 : 499 - 514
12345