{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T01:44:55Z","timestamp":1769910295359,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540180883","type":"print"},{"value":"9783540477471","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18088-5_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:26:04Z","timestamp":1330179964000},"page":"237-249","source":"Crossref","is-referenced-by-count":26,"title":["On the languages accepted by finite reversible automata"],"prefix":"10.1007","author":[{"given":"J. E.","family":"Pin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"D. Angluin, Inference of reversible languages, Journal of the Association for Computing Machinery 29 (1982) 741\u2013765.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"C.J. Ash, Finite semigroups with commuting idempotents, J. Austral. Math. Soc. Series A, to appear.","DOI":"10.1007\/978-94-009-3839-7_2"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"J.C. Birget, S.W. Margolis and J. Rhodes, Finite semigroups whose idempotents commute or form a subsemigroup, Proceedings of the Chico Conference on Semigroups (1986), to appear.","DOI":"10.1007\/978-94-009-3839-7_3"},{"key":"19_CR4","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":"19_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.2307\/1969513","volume":"52","author":"M. Hall Jr","year":"1950","unstructured":"M. Hall Jr, A topology for free groups and related groups, Ann. Math. 52 (1950) 127\u2013139.","journal-title":"Ann. Math."},{"key":"19_CR6","unstructured":"T.E. Hall, Biprefix codes, inverse semigroups and syntactic monoids of injective automata, Theoretical Computer Science."},{"key":"19_CR7","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"G. Lallement, Semigroups and Combinatorial Applications, Wiley, New-York (1979)."},{"key":"19_CR8","volume-title":"Combinatorics on Words, Encyclopedia of Mathematics 17","author":"M. Lothaire","year":"1983","unstructured":"M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics 17, Addison Wesley, New-York (1983)."},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0019-9958(67)90481-0","volume":"11","author":"R. McNaughton","year":"1967","unstructured":"R. McNaughton, The loop complexity of pure-group events. Inf. Control 11 (1967) 167\u2013176.","journal-title":"Inf. Control"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BFb0028813","volume":"199","author":"S. W. Margolis","year":"1985","unstructured":"S.W. Margolis and J.E. Pin, Languages and inverse semigroups, 11th ICALP, Lecture Notes in Computer Science 199, Springer, Berlin (1985) 285\u2013299.","journal-title":"11th ICALP, Lecture Notes in Computer Science"},{"key":"19_CR11","unstructured":"S.W. Margolis and J.E. Pin, Finite inverse semigroups, varieties and languages, Journal of Algebra, to appear."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BFb0015770","volume":"194","author":"J. E. Pin","year":"1985","unstructured":"J.E. Pin, Finite group topology and p-adic topology for free monoids, 12th ICALP, Lecture Notes in Computer Science 194 (1985) 445\u2013455.","journal-title":"12th ICALP, Lecture Notes in Computer Science"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"J.E. Pin, Varieties of formal languages, Masson, Paris (1984), North Oxford Academic, London and Plenum, New-York (1986).","DOI":"10.1007\/978-1-4613-2215-3_3"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02574174","volume":"18","author":"Ch. Reutenauer","year":"1979","unstructured":"Ch. Reutenauer, Une topologie du monoide libre, Semigroup Forum 18, (1979), 33\u201349.","journal-title":"Semigroup Forum"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02572788","volume":"22","author":"Ch. Reutenauer","year":"1981","unstructured":"Ch. Reutenauer, Sur mon article \"une topologie du monoide libre\", Semigroup Forum 22, (1981), 93\u201395.","journal-title":"Semigroup Forum"}],"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-18088-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:14:02Z","timestamp":1605626042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18088-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540180883","9783540477471"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-18088-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}