{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:12:01Z","timestamp":1725459121191},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540123172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0036926","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T12:38:14Z","timestamp":1138192694000},"page":"420-432","source":"Crossref","is-referenced-by-count":28,"title":["On the composition of morphisms and inverse morphisms"],"prefix":"10.1007","author":[{"given":"M.","family":"Latteux","sequence":"first","affiliation":[]},{"given":"J.","family":"Leguy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free language","author":"J. Berstel","year":"1979","unstructured":"J. BERSTEL, \u201cTransductions and context-free language\u201d, Teubner Verlag, Stuttgart, 1979."},{"key":"34_CR2","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"L. BOASSON and M. NIVAT, \u201cSur diverses familles de langages ferm\u00e9es par transduction rationnelle\u201d, Acta Informatica 2 (1973), pp.180\u2013188.","journal-title":"Acta Informatica"},{"key":"34_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(74)80008-5","volume":"9","author":"R.V. Book","year":"1974","unstructured":"R.V. BOOK, \u201cComparing complexity classes\u201d, J. Comput. System Sc. 9 (1974), pp. 213\u2013229.","journal-title":"J. Comput. System Sc."},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer programming and formal systems","author":"N. Chomsky","year":"1963","unstructured":"N. CHOMSKY and M.P. SCH\u00dcTZENBERGER, \u201cThe algebraic theory of context-free language\u201d, in Computer programming and formal systems (P. Braffort and D. Hirschberg Eds.), Amsterdam, North-Holland 1963, pp. 118\u2013161."},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0166-218X(82)90072-5","volume":"4","author":"K. Culik II","year":"1982","unstructured":"K. CULIK II, F.E. FICH and A. SALOMAA, \u201cA homomorphic characterization of regular languages\u201d, Discrete Appl. Math. 4 (1982), pp.149\u2013152.","journal-title":"Discrete Appl. Math."},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1051\/ita\/1979130302411","volume":"13","author":"K. Culik II","year":"1979","unstructured":"K. CULIK II, and H. MAURER, \u201cOn simple representation of language families\u201d, RAIRO Theor. Informatics 13 (1979), pp. 241\u2013250.","journal-title":"RAIRO Theor. Informatics"},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(76)90004-9","volume":"2","author":"S. Ginsburg","year":"1976","unstructured":"S. GINSBURG, J. GOLDSTINE and S. GREIBACH, \u201cSome uniformly erasable families of languages, Theoretical Computer Science 2 (1976), pp. 29\u201344.","journal-title":"Theoretical Computer Science"},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","volume":"2","author":"S. Greibach","year":"1973","unstructured":"S. GREIBACH, \u201cThe hardest CF language\u201d, SIAM J. Comput. 2 (1973), pp. 304\u2013310","journal-title":"SIAM J. Comput."},{"key":"34_CR9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(83)90045-8","volume":"5","author":"J. Karhum\u00e4ki","year":"1983","unstructured":"J. KARHUM\u00c4KI and M. LINNA, \u201cA note on morphic characterization of languages\u201d, Discrete Appl. Math. 5 (1983), pp. 243\u2013246.","journal-title":"Discrete Appl. Math."},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(81)90020-7","volume":"14","author":"M. Latteux","year":"1981","unstructured":"M. LATTEUX, \u201cA propos du lemme de substitution\u201d, Theoretical Computer Science 14 (1981), pp. 119\u2013123.","journal-title":"Theoretical Computer Science"},{"key":"34_CR11","unstructured":"M. LATTEUX and J. LEGUY, \u201cOn the usefulness of bifaithful rational cones\u201d, Publication I.T. 40\u201382, Lille, 1982."},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1051\/ita\/1981150201411","volume":"5","author":"J. Leguy","year":"1981","unstructured":"J. LEGUY, \u201cTraniductions rationnelles d\u00e9croissantes\u201d, RAIRO Theor. Informatics 5 (1981), pp. 141\u2013148.","journal-title":"RAIRO Theor. Informatics"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"M. NIVAT, \u201cTransductions dei langages de Chomsky\u201d, Ann. Inst. Fourier 18 (1968), pp. 339\u2013455.","journal-title":"Ann. Inst. Fourier"},{"key":"34_CR14","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"A. SALOMAA, \u201cFormal languages\u201d, Academic Press, New-York, 1973."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"P. TURAKAINEN, \u201cA homomorphic characterization of principal semi AFLs without using intersection with regular sets\u201d, 1982, Technical report, University of Oulu.","DOI":"10.1016\/0020-0255(82)90057-3"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036926.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:21:38Z","timestamp":1607534498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036926"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540123172"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0036926","relation":{},"subject":[]}}