{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:10:11Z","timestamp":1751368211635,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2021,5,12]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3233\/fi-2021-2033","type":"journal-article","created":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T16:02:18Z","timestamp":1621008138000},"page":"29-51","source":"Crossref","is-referenced-by-count":0,"title":["Two-Sided Strictly Locally Testable Languages"],"prefix":"10.1177","volume":"180","author":[{"given":"Markus","family":"Holzer","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany. holzer@informatik.uni-giessen.de, kutrib@informatik.uni-giessen.de"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany. holzer@informatik.uni-giessen.de, kutrib@informatik.uni-giessen.de"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[{"name":"Fachbereich Elektrotechnik\/Informatik, Universit\u00e4t Kassel, 34109 Kassel, Germany. f.otto@uni-kassel.de"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2021-2033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:54:07Z","timestamp":1751367247000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-2021-2033"}},"subtitle":[],"editor":[{"given":"Mika","family":"Hirvensalo","sequence":"additional","affiliation":[]},{"given":"Franti\u0161ek","family":"Mr\u00e1z","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Pr\u016f\u0161a","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,5,12]]},"references-count":0,"journal-issue":{"issue":"1-2"},"URL":"https:\/\/doi.org\/10.3233\/fi-2021-2033","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2021,5,12]]}}}