{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215012},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_48","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:32:38Z","timestamp":1188336758000},"page":"548-559","source":"Crossref","is-referenced-by-count":12,"title":["Rational Graphs Trace Context-Sensitive Languages"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Morvan","sequence":"first","affiliation":[]},{"given":"Colin","family":"Stirling","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"48_CR1","unstructured":"Autebert, J.-M. and Boasson, L.Transductions rationelles. Masson, 1988."},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J.Transductions and contextfree languages. Teubner, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Moller, F. Burkart, O., Caucal, D. and Steffen B.Handbook of Process Algebra, chapter Verification on infinite structures, pages 545\u2013623. Elsevier, 2001.","DOI":"10.1016\/B978-044482830-9\/50027-8"},{"key":"48_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-61440-0_128","volume-title":"Icalp 96","author":"D. Caucal","year":"1996","unstructured":"Caucal, D. On transition graphs having a decidable monadic theory. In Icalp 96, volume 1099 of LNCS, pages 194\u2013205, 1996."},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Courcelle, B.Handbook of Theoretical Computer Science, chapter Graph rewriting: an algebraic and logic approach. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0019-9958(66)90211-7","volume":"9","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S. and Rose, G. F. Preservation of languages by transducers. Information and control, 9:153\u2013176, 1966.","journal-title":"Information and control"},{"key":"48_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-48321-7_30","volume-title":"FCT","author":"T. Knapik","year":"1999","unstructured":"Knapik, T. and Payet, E. Synchronization product of linear bounded machines. In FCT, volume 1684 of LNCS, pages 362\u2013373, 1999."},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Mateescu, A., Salomaa, A.Handbook of Formal Languages, volume 1, chapter Aspects of classical language theory, pages 175\u2013252. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-59136-5_4"},{"key":"48_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-46432-8_17","volume-title":"Fossacs 00","author":"C. Morvan","year":"2000","unstructured":"Morvan, C. On rational graphs. In Fossacs 00, volume 1784 of LNCS, pages 252\u2013266, 2000."},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. Muller","year":"1985","unstructured":"Muller, D. and Schupp, P. The theory of ends, pushdown automata, and secondorder logic. Theoretical Computer Science, 37:51\u201375, 1985.","journal-title":"Theoretical Computer Science"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0019-9958(74)91049-3","volume":"25","author":"M. Penttonen","year":"1974","unstructured":"Penttonen, M. One-sided and two-sided context in formal grammars. Information and Control, 25:371\u2013392, 1974.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:27:48Z","timestamp":1556803668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}