{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T02:28:14Z","timestamp":1660271294158},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4702,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0304-3975(99)00108-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:13:43Z","timestamp":1027592023000},"page":"253-264","source":"Crossref","is-referenced-by-count":5,"title":["Right and left locally testable languages"],"prefix":"10.1016","volume":"246","author":[{"given":"Pedro","family":"Garc\u0131\u0301a","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00108-5_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(91)90258-4","article-title":"Pin, Languages and scanners","volume":"84","author":"J.E.","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00108-5_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","article-title":"Characterizations of locally testable events","volume":"4","author":"Brzozowski","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(99)00108-5_BIB3","series-title":"Automata, Languages and Machines, vol B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB4","series-title":"Introduction to Automata theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"issue":"3","key":"10.1016\/S0304-3975(99)00108-5_BIB5","first-page":"233","article-title":"Reduction algorithms for some classes of aperiodic monoids","volume":"19","author":"K\u00f6nig","year":"1985","journal-title":"R.A.I.R.O. Theor. Inform."},{"key":"10.1016\/S0304-3975(99)00108-5_BIB6","series-title":"Combinatorics on words","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0019-9958(80)90180-1","article-title":"A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup","volume":"44","author":"Luca","year":"1980","journal-title":"Inform. and Control"},{"issue":"1","key":"10.1016\/S0304-3975(99)00108-5_BIB8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01761708","article-title":"Algebraic decision procedures for local testability","volume":"8","author":"McNaughton","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB9","series-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB10","series-title":"Vari\u00e9t\u00e9s de Langages formels","author":"Pin","year":"1984"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB11","doi-asserted-by":"crossref","unstructured":"D. Perrin, Finite automata, Van Leeuwen (Ed.), Handbook of Theor. Com. Sci. Vol. B, Elsevier, Amsterdam, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50006-8"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(95)00100-X","article-title":"Over testable languages","volume":"161","author":"Selmi","year":"1996","journal-title":"Theoret. Comp. Sci."},{"key":"10.1016\/S0304-3975(99)00108-5_BIB13","doi-asserted-by":"crossref","unstructured":"I. Simon, Piecewise testable events, Lecture Notes in Comp. Sci., vol. 33, 1975, pp. 214\u2013222.","DOI":"10.1007\/3-540-07407-4_23"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB14","series-title":"Finite Automata, Formal Logic and Circuit Complexity","author":"Straubing","year":"1994"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0022-4049(85)90071-4","article-title":"Graph congruences and wreath products","volume":"35","author":"Th\u00e9rien","year":"1985","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0304-3975(99)00108-5_BIB16","doi-asserted-by":"crossref","unstructured":"Y. Zalcstein, Locally testable languages, J. Comput. Systems Sci. 6 (1972) 151\u2013167. 1972.","DOI":"10.1016\/S0022-0000(72)80020-5"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:19:49Z","timestamp":1578521989000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397599001085"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00108-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}