{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:22:27Z","timestamp":1742973747185,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_10","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"113-124","source":"Crossref","is-referenced-by-count":2,"title":["Strict Local Testability with Consensus Equals Regularity"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Crespi Reghizzi","sequence":"first","affiliation":[]},{"given":"Pierluigi L.","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0019-9958(80)90180-1","volume":"44","author":"A. de Luca","year":"1980","unstructured":"de Luca, A., Restivo, A.: A characterization of strictly locally testable languages and its applications to subsemigroups of a free semigroup. Information and Control\u00a044(3), 300\u2013319 (1980)","journal-title":"Information and Control"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Pin, J.-E.: Local languages and the Berry-Sethi algorithm. Theor. Comp. Sci.\u00a0155 (1996)","DOI":"10.1016\/0304-3975(95)00104-2"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01131538","volume":"79","author":"V. Braitenberg","year":"1992","unstructured":"Braitenberg, V., Pulverm\u00fcller, F.: Entwurf einer neurologischen Theorie der Sprache. Naturwissenschaften\u00a079, 103\u2013117 (1992)","journal-title":"Naturwissenschaften"},{"issue":"1-2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0304-3975(98)00332-6","volume":"242","author":"P. Caron","year":"2000","unstructured":"Caron, P.: Families of locally testable languages. Theor.\u00a0Comp.\u00a0Sci.\u00a0242(1-2), 361\u2013376 (2000)","journal-title":"Theor.\u00a0Comp.\u00a0Sci."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-88282-4_19","volume-title":"Language and Automata Theory and Applications","author":"S. Crespi Reghizzi","year":"2008","unstructured":"Crespi Reghizzi, S., San Pietro, P.: Consensual Definition of Languages by Regular Sets. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 196\u2013208. Springer, Heidelberg (2008), \n                      http:\/\/dx.doi.org\/10.1007\/978-3-540-88282-4_19"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1051\/ita\/2011012","volume":"45","author":"S. Crespi Reghizzi","year":"2011","unstructured":"Crespi Reghizzi, S., San Pietro, P.: Consensual languages and matching finite-state computations. RAIRO - Theor. Inf. and Applic.\u00a045(1), 77\u201397 (2011), \n                      http:\/\/dx.doi.org\/10.1051\/ita\/2011012","journal-title":"RAIRO - Theor. Inf. and Applic."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Crespi Reghizzi, S., San Pietro, P.: From regular to strictly locally testable languages. In: Ambroz, P., Holub, S., Mas\u00e1kov\u00e1, Z. (eds.) WORDS, Proc. 8th Int. Conf. Words 2011. EPTCS, vol.\u00a063, pp. 103\u2013111 (2011), \n                      http:\/\/dx.doi.org\/10.4204\/EPTCS.63","DOI":"10.4204\/EPTCS.63.14"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/S0092-8240(87)90018-8","volume":"49","author":"T. Head","year":"1987","unstructured":"Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biology\u00a049, 737\u2013759 (1987)","journal-title":"Bull. Math. Biology"},{"key":"10_CR9","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free Automata. MIT Press, Cambridge (1971)"},{"key":"10_CR10","first-page":"215","volume-title":"Sequential Machines \u2013 Selected Papers (translated from Russian)","author":"Y.T. Medvedev","year":"1964","unstructured":"Medvedev, Y.T.: On the class of events representable in a finite automaton. In: Moore, E.F. (ed.) Sequential Machines \u2013 Selected Papers (translated from Russian), pp. 215\u2013227. Addison-Wesley, New York (1964)"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s12064-003-0039-6","volume":"122","author":"F. Pulverm\u00fcller","year":"2003","unstructured":"Pulverm\u00fcller, F.: Sequence detectors as a basis of grammar in the brain. Theory in Biosciences\u00a0122, 87\u2013104 (2003), \n                      http:\/\/dx.doi.org\/10.1007\/s12064-003-0039-6","journal-title":"Theory in Biosciences"},{"key":"10_CR12","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press (1974)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T05:35:28Z","timestamp":1676784928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}