{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:17Z","timestamp":1725456977002},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032055","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"512-525","source":"Crossref","is-referenced-by-count":0,"title":["Boolean closure and unambiguity of rational sets"],"prefix":"10.1007","author":[{"given":"Maryse","family":"Pelletier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/S0019-9958(65)90275-5","volume":"8","author":"V. Amar","year":"1965","unstructured":"Amar V. and Puzolu G. (1965), \u201cGeneralizations of regular events\u201d, Information and Control 8, 56\u201363.","journal-title":"Information and Control"},{"key":"39_CR2","first-page":"1188","volume":"269","author":"M. Benois","year":"1969","unstructured":"Benois M. (1969), \u201cParties rationnelles du groupe libre\u201d, C.R. Acad. Sci. Paris, Ser. A 269, 1188\u20131190.","journal-title":"C.R. Acad. Sci. Paris"},{"key":"39_CR3","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":"Berstel J. (1979), \u201cTransductions and Context-free Languages\u201d, Teubner, Stuttgart."},{"key":"39_CR4","volume-title":"Contribution \u00e0 l'\u00e9tude de quelques familles remarquables de fonctions rationnelles","author":"C. Choffrut","year":"1978","unstructured":"Choffrut Ch. (1978), \u201cContribution \u00e0 l'\u00e9tude de quelques familles remarquables de fonctions rationnelles\u201d, Th\u00e8se Sci. math., Univ. Paris 6, Paris."},{"key":"39_CR5","unstructured":"Conway J.H. (1971), \u201cRegular Algebra and Finite Machines\u201d, Chapman and Hall."},{"key":"39_CR6","volume-title":"\u201cAutomata, Languages and Machines\u201d, Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg S. (1974), \u201cAutomata, Languages and Machines\u201d, Vol. A, Academic Press, New York."},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg S., Sch\u00fctzenberger M.P. (1969), \u201cRational sets in commutative monoids\u201d, Journal of Algebra, 13, 173\u2013191.","journal-title":"Journal of Algebra"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Johnson J.H. (1985), \u201cDo Rational Equivalence Relations have Regular Cross-Sections?\u201d, Proc. of the 12th International Conf. on Automata, Languages, and Programming, Springer-Verlag LNCS 194 300\u2013309.","DOI":"10.1007\/BFb0015755"},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0021-8693(69)90015-5","volume":"12","author":"J. D. McKnight Jr.","year":"1969","unstructured":"McKnight J. D., Jr. and Storey A. J. (1969), \u201cEquidivisible semigroups\u201d, Journal of Algebra, 12, 24\u201348.","journal-title":"Journal of Algebra"},{"key":"39_CR10","unstructured":"Pelletier M. (1989), \u201cDescriptions de semigroupes par automates\u201d, Th\u00e8se de l'Universit\u00e9 Paris 6."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Pelletier M., Sakarovitch J. (1988), \u201cEasy multiplications II, Extensions of rational semigroups\u201d, Rapport LITP Univ. Paris 6, 88\u201363, to appear in Information and Computation (1990).","DOI":"10.1016\/0890-5401(90)90003-Z"},{"key":"39_CR12","first-page":"417","volume":"17","author":"J. Sakarovitch","year":"1981","unstructured":"Sakarovitch J. (1981), \u201cDescription des mono\u00efdes de type fini\u201d, EIK, 17, 417\u2013434.","journal-title":"EIK"},{"issue":"3","key":"39_CR13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0890-5401(87)90020-4","volume":"74","author":"J. Sakarovitch","year":"1987","unstructured":"Sakarovitch J. (1987), Easy Multiplications. I. The Realm of Kleene's Theorem, Information and Computation, Vol. 74, No. 3, 173\u2013197.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:44:30Z","timestamp":1586612670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0032055","relation":{},"subject":[]}}