{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:13:33Z","timestamp":1767237213404},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540088608"},{"type":"electronic","value":"9783540358077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_25","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:34:26Z","timestamp":1330169666000},"page":"345-352","source":"Crossref","is-referenced-by-count":32,"title":["Sur un cas particulier de la conjecture de Cerny"],"prefix":"10.1007","author":[{"given":"J. E.","family":"Pin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"25_CR1","unstructured":"BOOTH. T.J.: Sequencial Machines and Automata theory, John Wiley and Sons, Inc. New-York p. 176\u2013179."},{"key":"25_CR2","first-page":"208","volume":"14","author":"J. \u010cern\u00fd","year":"1964","unstructured":"\u010cERN\u00dd J.: Pozn\u00e1mka k homog\u00e9nnym experimenton s kone\u010dn\u00fdmi automati. Mat. fyz. \u010das. SAV. 14 (1964), 208\u2013215.","journal-title":"Mat. fyz. \u010das. SAV."},{"key":"25_CR3","unstructured":"\u010cERN\u00dd J.: Communication at the Bratislava Conf\u00e9rence on Cybernetics. (1969)."},{"key":"25_CR4","first-page":"4","volume":"7","author":"J. \u010cern\u00fd","year":"1971","unstructured":"\u010cERN\u00dd J., PIRICK\u00c1 A., ROSENAUEROV\u00c1 B.: On directable automata. Kybernetika 7 (1971), 4.","journal-title":"Kybernetika"},{"key":"25_CR5","first-page":"414","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1970","unstructured":"KOHAVI Z.: Switching and Finite Automata Theory, Mc Graw-Hill Book Co. New-York (1970) p. 414\u2013416."},{"key":"25_CR6","unstructured":"KOHAVI Z. et WINOGRAD J.: Bounds on the length of synchronizing sequences and the order of information losslessness Proc. of an international symposium on the Theory of Machines and Computations, Haifa, Israel (1971)."},{"key":"25_CR7","volume-title":"Algebra","author":"S. Lang","year":"1965","unstructured":"LANG S.: Algebra, Addison-Wesley, Reading, 1965."},{"key":"25_CR8","unstructured":"MOORE E.F.: Gedanken-experiments. p. 129\u2013153 Automata Studies, Annals of Math. Studies, No 34 (1956)."},{"key":"25_CR9","unstructured":"PERRIN D.: Codes asynchrones, A para\u00eetre dans le bulletin de la Soc. Math. de France (1978)."},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/3-540-07854-1_214","volume":"45","author":"D. Perrin","year":"1976","unstructured":"PERRIN D. et SCHUTZENBERGER M.P.: Codes et sous-mono\u00efdes poss\u00e9dant des mots neutres. Theoretical Computer Science Lecture Notes in Comput. Sc.45 Springer Verlag (1976) p. 453\u201357.","journal-title":"Theoretical Computer Science Lecture Notes in Comput. Sc."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"PERROT J.F.: La th\u00e9orie des codes \u00e0 longueur variable. Theoretical Computer Science, 3rd G.I. Conference, Lecture Notes in Computer Science no48 Springer 1977) p. 27\u201344.","DOI":"10.1007\/3-540-08138-0_3"},{"key":"25_CR12","unstructured":"PIN J.E.: Sur la longueur des mots de rang donn\u00e9 d'un automate fini. C.R. Acad. Sc. Paris, t. 284 (16 mai 1977)."},{"key":"25_CR13","unstructured":"PIN J.E.: Sur les mots synchronisants dans un automate fini, \u00e0 para\u00eetre dans Elektronische Informationverarbeitung und Kybernetic."},{"key":"25_CR14","unstructured":"PIN J.E.: Th\u00e8se de troisi\u00e8me cycle, Paris, \u00e0 para\u00eetre."},{"issue":"4","key":"25_CR15","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/S0019-9958(67)90620-1","volume":"11","author":"M. P. Schutzenberger","year":"1967","unstructured":"SCHUTZENBERGER M.P.: On synchronizing prefix codes, Information and control, Vol 11, No 4, Octobre 1967 (p. 396\u2013401)","journal-title":"Information and control"},{"key":"25_CR16","first-page":"257","volume":"2","author":"P. H. Starke","year":"1966","unstructured":"STARKE P.H.: Eine Bemerkung \u00fcber homogene Experimente. Elektr. Informationverarbeitung und Kyb. 2 (1966) 257\u2013259.","journal-title":"Elektr. Informationverarbeitung und Kyb."},{"key":"25_CR17","unstructured":"STARKE P.H.: Abstrakte Automaten, VEB Deutscher Verlag der Wissenschaft (1969) ou Abstract Automata. North Holland (1972)"},{"issue":"1","key":"25_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/sapm1970491101","volume":"XLIX","author":"D. J. Kfoury","year":"1970","unstructured":"KFOURY D.J. Synchronizing sequences for Probabilistic Automata. Studies in Applied Mathematics. Vol XLIX No1, Mars 1970 p. 101\u2013103.","journal-title":"Studies in Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:00:04Z","timestamp":1605625204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]}}}