Two-Sided Strictly Locally Testable Languages

被引：0
|
作者：
Holzer, Markus [1 ]
Kutrib, Martin [1 ]
Otto, Friedrich [2 ]
机构：
[1] Univ Giessen, Inst Informat, Arndtstr 2, D-35392 Giessen, Germany
[2] Univ Kassel, Fachbereich Elektrotech Informat, D-34109 Kassel, Germany
来源：
FUNDAMENTA INFORMATICAE | 2021年 / 180卷 / 1-2期
关键词：
D O I：
10.3233/FI-2021-2033
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A two-sided extension of strictly locally testable languages is presented. In order to determine membership within a two-sided strictly locally testable language, the input must be scanned from both ends simultaneously, whereby it is synchronously checked that the factors read are correlated with respect to a given binary relation. The class of two-sided strictly locally testable languages is shown to be a proper subclass of the even linear languages that is incomparable to the regular languages with respect to inclusion. Furthermore, closure properties of the class of two-sided strictly locally testable languages and decision problems are studied. Finally, it is shown that two-sided strictly k-testable languages are learnable in the limit from positive data.
引用
收藏
页码：29 / 51
页数：23
相关论文
共 50 条
  • [1] Splicing representations of strictly locally testable languages
    Head, T
    DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 139 - 147
  • [2] 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
  • [3] From Regular to Strictly Locally Testable Languages
    Reghizzi, Stefano Crespi
    San Pietro, Pierluigi
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 103 - 111
  • [4] Parsing with probabilistic strictly locally testable tree languages
    Verdú-Mas, JL
    Carrasco, RC
    Calera-Rubio, J
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (07) : 1040 - 1050
  • [5] Relations of contextual grammars with strictly locally testable selection languages
    Dassow, Juergen
    Truthe, Bianca
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2023, 57
  • [6] On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages
    Dassow, Juregen
    Truthe, Bianca
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2022, (367): : 65 - 80
  • [7] 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)
  • [8] 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
  • [9] Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
    Truthe, Bianca
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, 386 : 253 - 268
  • [10] On Two-sided Locally Convex H*-algebras
    Haralampidou, Marina
    Maria Perez-Tiscareno, Reyna
    MEDITERRANEAN JOURNAL OF MATHEMATICS, 2013, 10 (01) : 411 - 424
12345