{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:04Z","timestamp":1725663304685},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540127277"},{"type":"electronic","value":"9783540387145"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12727-5_6","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:55:14Z","timestamp":1330192514000},"page":"129-140","source":"Crossref","is-referenced-by-count":2,"title":["Prefix and perfect languages"],"prefix":"10.1007","author":[{"given":"J.","family":"Beauquier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01768474","volume":"11","author":"J. M. Autebert","year":"1977","unstructured":"Autebert J.M. \u2014 Non-principalit\u00e9 du cylindre des langages \u00e0 compteur, Math. Systems Theory, 11, 157\u2013167, 1977.","journal-title":"Math. Systems Theory"},{"key":"6_CR2","unstructured":"Autebert J.M., Beauquier J., Boasson L., Senizergues G. \u2014 Remarques sur les langages de parenth\u00e8ses, submitted to Acta Informatica, (available in LITP report)."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Berstel J. \u2014 Transductions and context-free languages, Teubner Verlag \u2014 1980.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01768473","volume":"11","author":"L. Boasson","year":"1977","unstructured":"Boasson L. & Nivat M. \u2014 Le cylindre des langages lin\u00e9aires, Math. Syst. Theory 11, 147\u2013155, 1977.","journal-title":"Math. Syst. Theory"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF01706090","volume":"6","author":"Y. Cesari","year":"1972","unstructured":"Cesari Y. \u2014 Sur un algorithme donnant les codes bipr\u00e9fixes finis, Math. Syst. Theory 6 (3), 221\u2013225, 1972.","journal-title":"Math. Syst. Theory"},{"key":"6_CR6","volume-title":"Automata, Languages and Machines, Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg S. \u2014 Automata, Languages and Machines, Vol. A, Academic Press, New York and London, 1974."},{"key":"6_CR7","unstructured":"Ginsburg S. \u2014 Algebraic and automata \u2014 theoretic properties of context-free languages. \u2014 North Holland, 1975."},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1137\/0202025","volume":"2","author":"S. Greibach","year":"1973","unstructured":"Greibach S. \u2014 The hardest context-free language, SIAM Journal of Comp. 2, 301\u2013304, 1973.","journal-title":"SIAM Journal of Comp."},{"key":"6_CR9","unstructured":"Harrison M. \u2014 Introduction to formal languages theory, Addison-Wesley Reading, Mass, 1978."},{"key":"6_CR10","first-page":"824","volume":"217 A","author":"M. Nivat","year":"1970","unstructured":"Nivat M. & Perrot J.F. \u2014 Une g\u00e9n\u00e9ralisation du mono\u00efde bicyclique, C.R. Acad. Sci. Paris, 217 A, 824\u2013827, 1970.","journal-title":"C.R. Acad. Sci. Paris"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF01214481","volume":"153","author":"D. Perrin","year":"1977","unstructured":"Perrin D. \u2014 La transitivit\u00e9 du groupe d'un code bipr\u00e9fixe fini, Math. Z. 153, 283\u2013287, 1977.","journal-title":"Math. Z."},{"key":"6_CR12","first-page":"19","volume-title":"Permutations, Gauthiers-Villars","author":"J. F. Perrot","year":"1974","unstructured":"Perrot J.F. \u2014 Groupes de permutations associ\u00e9s aux codes pr\u00e9fixes finis, in A. Lent\u00een (Ed.), Permutations, Gauthiers-Villars, Mouton, Paris, 19\u201335, 1974."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(64)90232-3","volume":"7","author":"M. P. Sch\u00fctzenberger","year":"1964","unstructured":"Sch\u00fctzenberger M.P. \u2014 On the synchronization properties of certain prefix codes, Inf. Control 7, 23\u201336, 1964.","journal-title":"Inf. Control"},{"key":"6_CR14","unstructured":"Takahashi M. \u2014 Nest sets and relativized closure properties, to appear in Theoretical Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","CAAP'83"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12727-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:16Z","timestamp":1605643576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12727-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540127277","9783540387145"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-12727-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}