{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:54Z","timestamp":1725663054872},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_79","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:51:50Z","timestamp":1330195910000},"page":"294-303","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Etude syntaxique des parties reconnaissables de mots infinis"],"prefix":"10.1007","author":[{"given":"Jean-Pierre","family":"Pecuchet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A. Arnold","year":"1985","unstructured":"A. ARNOLD (1985): A syntactic congruence for rational \u03c9-languages; Theor.Comp.Sci. 39 (1985) p 333\u2013335.","journal-title":"Theor.Comp.Sci."},{"key":"31_CR2","unstructured":"A. ARNOLD, M. NIVAT (1982): Comportements de processus; Colloque des Math\u00e9matiques de l'Informatique, Paris, 35\u201368."},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"J.A. Brzozowski","year":"1973","unstructured":"J.A. BRZOZOWSKI, I. SIMON (1973): Characterizations of locally testable events; Discrete Math., 4, 243\u2013271.","journal-title":"Discrete Math."},{"key":"#cr-split#-31_CR4.1","unstructured":"J.R. BUCHI (1962): On a decision method in restricted second order arithmetic"},{"key":"#cr-split#-31_CR4.2","unstructured":"Logic, Methodology and Philosophy of Science, (Proc. 1960 Int. Congr.), Stanford Univ. Press, 1-11."},{"key":"31_CR5","unstructured":"S. EILENBERG (1976): Automata, Languages and Machines, Vol. B.; Academic Press."},{"key":"31_CR6","volume-title":"Semigroups and combinatorial applications","author":"G. Lallement","year":"1979","unstructured":"G. LALLEMENT (1979): Semigroups and combinatorial applications; Whiley, New-York."},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"L.H. LANDWEBER (1969): Decision Problems for \u03c9-automata; Math. Syst. Th., 3, 376\u2013384.","journal-title":"Math. Syst. Th."},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. Mac Naughton","year":"1966","unstructured":"R. Mac NAUGHTON (1966): Testing and generating infinite sequences by a finite automation; Inf. and Control, 9, 521\u2013530.","journal-title":"Inf. and Control"},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R. Mac Naughton","year":"1974","unstructured":"R. Mac NAUGHTON (1974): Algebraic decision procedures for local testability; Math. Syst. Th., 8, 60\u201376.","journal-title":"Math. Syst. Th."},{"key":"31_CR10","unstructured":"D. MULLER (1963): Infinite sequences and finite machines; Switching Theory and Logical Design, (Proc. 4 th IEEE Symp.), 3\u201316."},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-16078-7_75","volume":"210","author":"J.P. Pecuchet","year":"1976","unstructured":"J.P. PECUCHET (1976): Vari\u00e9t\u00e9s de semigroupes et mots infinis; (Proc. STACS 86), Lect. Notes in Comp. Sci. 210, 180\u2013191.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"31_CR12","first-page":"595","volume":"295","author":"D. Perrin","year":"1982","unstructured":"D. PERRIN (1982): Vari\u00e9t\u00e9s de semigroupes et mots infinis; C.R. Acad. Sci. Paris, 295, 595\u2013598.","journal-title":"C.R. Acad. Sci. Paris"},{"key":"31_CR13","first-page":"134","volume":"176","author":"D. Perrin","year":"1984","unstructured":"D. PERRIN (1984): Recent Results on Automata and infinite Words; Math. Found Comp. Sci., (Proc. 11th symp. Praha), Lecture Notes in Compt. Sci., 176, 134\u2013148.","journal-title":"Math. Found Comp. Sci."},{"key":"31_CR14","unstructured":"J.E. PIN (1984): Vari\u00e9t\u00e9s de langages et mono\u00efdes; Masson."},{"key":"31_CR15","unstructured":"M.P. SCHUTZENBERGER (1973): A propos des relations rationnelles fonctionnelles; Automata Languages and Programming, Nivat \u00e9d., North Holland, 103\u2013114."},{"key":"31_CR16","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume":"33","author":"I. Simon","year":"1975","unstructured":"I. SIMON (1975): Piecewise testable events; Automata Theory and Formal Languages (2nd G.I. Conf.), Lect. Notes in Comp. Sci. 33, Springer Verlag, 214\u2013322.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"31_CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0019-9958(81)90663-X","volume":"48","author":"W. Thomas","year":"1981","unstructured":"W. THOMAS (1981): A combinatorial approach to the theory of \u03c9-automata; Inf. and Control, 48, 261\u2013283.","journal-title":"Inf. and Control"},{"key":"31_CR18","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"K. WAGNER (1979): On \u03c9-regular Sets; Inf. and Control, 43, 123\u2013177.","journal-title":"Inf. and Control"},{"key":"31_CR19","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","volume":"6","author":"Y. Zalcstein","year":"1972","unstructured":"Y. ZALCSTEIN (1972): Locally testable languages; J.Comp.Syst.Sci., 6, 151\u2013167.","journal-title":"J.Comp.Syst.Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:10:38Z","timestamp":1558267838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}