{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:58Z","timestamp":1725663178044},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540081388"},{"type":"electronic","value":"9783540373896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08138-0_23","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:18:33Z","timestamp":1330186713000},"page":"270-281","source":"Crossref","is-referenced-by-count":9,"title":["Codes et sous-monoides possedant des mots neutres"],"prefix":"10.1007","author":[{"given":"D.","family":"Perrin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. -P.","family":"Sch\u00fctzenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,23]]},"reference":[{"key":"23_CR1","unstructured":"BERSTEL, J.\u2014 Sur la densit\u00e9 asymptotique des langages formels, in Automata Languages and Programming (M. Nivat ed.) North Holland (1972) 345\u201358."},{"key":"23_CR2","unstructured":"BOE, J.M.\u2014 Repr\u00e9sentations des monoides: applications \u00e0 la th\u00e9orie des codes, Th\u00e8se de 3\u00e8me cycle, Univ. des Sciences et Techniques du Languedoc (1976)."},{"key":"23_CR3","unstructured":"BOE, J.M., BOYAT, J. CESARI, Y., LACHENY, A. et M. VINCENT, Automates et monoides syntaxiques des sous-monoides libres, \u00e0 para\u00eetre dans Information and Control."},{"key":"23_CR4","unstructured":"EILENBERG, S.\u2014 Automata, Languages and Machines, Vol. A, Academic Press (1974)."},{"key":"23_CR5","unstructured":"LALLEMENT, G.\u2014 On regular semigroups as syntactic monoids of prefix codes, \u00e0 para\u00eetre dans Theoretical Computer Science."},{"key":"23_CR6","unstructured":"NIVAT, M.\u2014 El\u00e9ments de la th\u00e9orie g\u00e9n\u00e9rale des codes, in Automata Theory (E.R. Caianiello ed.) Academic Press (1966)."},{"key":"23_CR7","unstructured":"Mc NAUGHTON, R. and PAPERT, S.\u2014 Counter-Free Automata, MIT Press (1971)."},{"key":"23_CR8","unstructured":"PERROT, J-F.\u2014 Contribution \u00e0 l'Etude des Monoides Syntaxiques et de Certains Groupes Associ\u00e9s aux Automates Finis, Th\u00e8se, Paris (1972)."},{"key":"23_CR9","unstructured":"RESTIVO, A.\u2014 On codes having no finite completions, in Automata, Languages and Programming (S. Michaelson ed.) Edinburgh University Press (1976) 38\u201344."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08138-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:51:19Z","timestamp":1619556679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08138-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540081388","9783540373896"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-08138-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}