{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:48Z","timestamp":1725663588877},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53414-8_42","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:02:28Z","timestamp":1330207348000},"page":"195-203","source":"Crossref","is-referenced-by-count":0,"title":["Monoids described by pushdown automata"],"prefix":"10.1007","author":[{"given":"Maryse","family":"Pelletier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"16_CR1","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":"16_CR2","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":"16_CR3","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":"16_CR4","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg S. (1974), \u201cAutomata, Languages and Machines\u201d, Vol. A, Academic Press, New York."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/0021-8693(71)90094-9","volume":"19","author":"M. Fliess","year":"1971","unstructured":"Fliess M. (1971), \u201cDeux applications de la repr\u00e9sentation matricielle d'une s\u00e9rie rationnelle non commutative\u201d, Journal of Algebra, 19, 344\u2013353.","journal-title":"Journal of Algebra"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Ginsburg S. (1966), \u201cThe Mathematical Theory of Context-free Languages\u201d, Mac Graw Hill.","DOI":"10.1145\/321312.321318"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","volume":"9","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg S., Greibach S. (1966), \u201cDeterministic Context-free Languages\u201d, Inform. and Control, 9, 620\u2013648.","journal-title":"Inform. and Control"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"Nivat M. (1968), \u201cTransductions des langages de Chomsky\u201d, Ann. Inst. Fourier, 18, 339\u2013456.","journal-title":"Ann. Inst. Fourier"},{"key":"16_CR9","unstructured":"Nivat M. (1970), \u201cSur les automates \u00e0 m\u00e9moire \u00e0 pile\u201d, Proc. of International Computing Symposium, Bonn (W. Itzfeld, ed.); North Holland, 655\u2013663."},{"key":"16_CR10","unstructured":"Pelletier M. (1989), \u201cDescriptions de semigroupes par automates\u201d, Th\u00e8se de l'Universit\u00e9 Paris 6."},{"key":"16_CR11","unstructured":"Sakarovitch J. (1979), \u201cSyntaxe des langages de Chomsky\u201d, Th. Sc. Math., Univ. Paris 7."},{"key":"16_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":"16_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","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:49:55Z","timestamp":1605646195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}