{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:48Z","timestamp":1725491448478},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_26","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"266-277","source":"Crossref","is-referenced-by-count":0,"title":["Reduced Languages as \u03c9-Generators"],"prefix":"10.1007","author":[{"given":"Sandrine","family":"Julia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tran Vinh","family":"Duc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Augros, X.: Etude des g\u00e9n\u00e9rateurs de langages de mots infinis. Master\u2019s thesis, Univ. de Nice - Sophia Antipolis (june 1997)"},{"key":"26_CR2","volume-title":"Theory of codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of codes. Academic Press, London (1985)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","volume":"20","author":"L. Boasson","year":"1980","unstructured":"Boasson, L., Nivat, M.: Adherences of languages. Journal of Computer and System Sciences\u00a020, 285\u2013309 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR4","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetics. In: International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press (1960)"},{"issue":"3","key":"26_CR5","first-page":"183","volume":"4","author":"J. Devolder","year":"1999","unstructured":"Devolder, J.: Generators with bounded deciphering delay for rational \u03c9-languages. Journal of Automata, Languages and Combinatorics\u00a04(3), 183\u2013204 (1999)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"4","key":"26_CR6","first-page":"241","volume":"11","author":"J. Devolder","year":"1994","unstructured":"Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words. Acta. Cybernetica\u00a011(4), 241\u2013256 (1994)","journal-title":"Acta Cybernetica"},{"key":"26_CR7","unstructured":"Julia, S.: Sur les codes et les \u03c9-codes g\u00e9n\u00e9rateurs de langages de mots infinis. PhD thesis, Universit\u00e9 de Nice - Sophia Antipolis (1996)"},{"key":"26_CR8","unstructured":"Julia, S.: A characteristic language for rational \u03c9-powers. In: Proc. 3\n                    rd\n                   Int. Conf. Developments in Language Theory, pp. 299\u2013308, Thessaloniki (1997)"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(96)00136-6","volume":"60","author":"S. Julia","year":"1996","unstructured":"Julia, S., Litovsky, I., Patrou, B.: On codes, \u03c9-codes and \u03c9-generators. Information Processing Letters\u00a060(1), 1\u20135 (1996)","journal-title":"Information Processing Letters"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(85)90100-8","volume":"40","author":"J. Karhum\u00e4ki","year":"1985","unstructured":"Karhum\u00e4ki, J.: On three-element codes. Theoret. Comput. Sc.\u00a040, 3\u201311 (1985)","journal-title":"Theoret. Comput. Sc."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(86)90131-6","volume":"23","author":"M. Latteux","year":"1986","unstructured":"Latteux, M., Timmerman, E.: Finitely generated \u03c9-langages. Information Processing Letters\u00a023, 171\u2013175 (1986)","journal-title":"Information Processing Letters"},{"issue":"1-2","key":"26_CR12","first-page":"35","volume":"10","author":"I. Litovsky","year":"1991","unstructured":"Litovsky, I.: Free submonoids and minimal \u03c9-generators of R\n                  \n                    \u03c9\n                  . Acta. Cybernetica\u00a010(1-2), 35\u201343 (1991)","journal-title":"Acta Cybernetica"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0190(91)90134-4","volume":"37","author":"I. Litovsky","year":"1991","unstructured":"Litovsky, I.: Prefix-free languages as \u03c9-generators. Information Processing Letters\u00a037, 61\u201365 (1991)","journal-title":"Information Processing Letters"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(87)90063-6","volume":"53","author":"I. Litovsky","year":"1987","unstructured":"Litovsky, I., Timmerman, E.: On generators of rational \u03c9-power languages. Theoretical Computer Science\u00a053, 187\u2013200 (1987)","journal-title":"Theoretical Computer Science"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"26_CR16","volume-title":"Infinite words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite words. Elsevier Academic Press, Amsterdam (2004)"},{"issue":"4","key":"26_CR17","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1051\/ita\/1986200404831","volume":"20","author":"L. Staiger","year":"1986","unstructured":"Staiger, L.: On infinitary finite length codes. Theoretical Informatics and Applications\u00a020(4), 483\u2013494 (1986)","journal-title":"Theoretical Informatics and Applications"},{"key":"26_CR18","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, ch. 4, Elsevier Science Publishers, Amsterdam (1990)"},{"key":"26_CR19","unstructured":"Tran Vinh Duc. A la recherche des codes g\u00e9n\u00e9rateurs de langages de mots infinis. Master\u2019s thesis, IFI Hano\u00ef - Univ. de Nice - Sophia Antipolis (2006)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:34:14Z","timestamp":1558488854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}