{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:53Z","timestamp":1725455633811},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540139125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024023","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:44:22Z","timestamp":1132379062000},"page":"351-362","source":"Crossref","is-referenced-by-count":2,"title":["Groups, codes and unambiguous automata"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Weil","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"J. Berstel, Transductions and context-free languages, Teubner, Stuttgart (1979)."},{"key":"35_CR2","unstructured":"J. Berstel, D. Perrin et al., The theory of codes, to appear."},{"key":"35_CR3","volume-title":"Automata, languages and machines, vol. B","author":"S. Eilenberg","year":"1976","unstructured":"S. Eilenberg, Automata, languages and machines, vol. B, Academic Press, New-York (1976)."},{"key":"35_CR4","volume-title":"Semigroups and combinatorial applications","author":"G. Lallement","year":"1979","unstructured":"G. Lallement, Semigroups and combinatorial applications, Wiley, New-York (1979)."},{"key":"35_CR5","volume-title":"Sur les relations entre un nombre fini de mots","author":"E. Rest Le","year":"1979","unstructured":"E. Le Rest and M. Le Rest, Sur les relations entre un nombre fini de mots, Th\u00e8se de troisi\u00e8me cycle, Rouen (1979)."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"E. Le Rest and S. Margolis, On the group complexity of a finite language, in Lecture Notes in Computer Science 154, Springer (1983), 433\u2013434.","DOI":"10.1007\/BFb0036927"},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(89)90085-6","volume":"21","author":"S. Margolis","year":"1982","unstructured":"S. Margolis, On the syntactic transformation semigroup of the language generated by a finite biprefix code, Theoretical Computer Science 21 (1982), 225\u2013230.","journal-title":"Theoretical Computer Science"},{"key":"35_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01214481","volume":"153","author":"D. Perrin","year":"1977","unstructured":"D. Perrin, La transitivit\u00e9 du groupe d'un code bipr\u00e9fixe fini, Mathematische Zeitschrift 153 (1977), 283\u2013287.","journal-title":"Mathematische Zeitschrift"},{"key":"35_CR9","unstructured":"D. Perrin, Sur les groupes dans les monoides finis, in Actes du Colloque Non commutative methods in algebraic and geometric combinatorics (A. de Luca ed.) Napoli (1979), 27\u201345."},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0089811","volume":"855","author":"D. Perrin","year":"1980","unstructured":"D. Perrin and J.F. Perrot, A propos des groupes dans certains mono\u00efdes syntactiques, in Lecture Notes in Mathematics 855, Springer (1980), 82\u201391.","journal-title":"Lecture Notes in Mathematics"},{"key":"35_CR11","volume-title":"Vari\u00e9t\u00e9s de langages formels","author":"J.E. Pin","year":"1984","unstructured":"J.E. Pin, Vari\u00e9t\u00e9s de langages formels, Dunod, Paris (1984)."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"J.E. Pin and J. Sakarovitch, Operations and transductions that preserve rationality, in 6th G.I. Conference, Lecture Notes in Computer Science 145, Springer, 277\u2013288.","DOI":"10.1007\/BFb0009652"},{"key":"35_CR13","volume-title":"Groupes finis et mono\u00efdes syntactiques","author":"G. Rindone","year":"1983","unstructured":"G. Rindone, Groupes finis et mono\u00efdes syntactiques, Th\u00e8se de troisi\u00e8me cycle, Paris (1983)."},{"key":"35_CR14","unstructured":"J. Sakarovitch, Sur la d\u00e9finition du produit en couronne, in Colloque Codages et transductions (Pirillo ed.), Florence (1981), 285\u2013300."}],"container-title":["Lecture Notes in Computer Science","STACS 85"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0024023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:25:28Z","timestamp":1586568328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540139125"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0024023","relation":{},"subject":[]}}