{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T05:20:24Z","timestamp":1736054424320,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_17","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"180-191","source":"Crossref","is-referenced-by-count":2,"title":["Linearly Bounded Infinite Graphs"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Carayol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-61440-0_128","volume-title":"Automata, Languages and Programming","author":"D. Caucal","year":"1996","unstructured":"Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 194\u2013205. Springer, Heidelberg (1996)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(01)00089-5","volume":"290","author":"D. Caucal","year":"2003","unstructured":"Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci.\u00a0290, 79\u2013115 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0304-3975(02)00655-2","volume":"296","author":"D. Caucal","year":"2003","unstructured":"Caucal, D.: On the transition graphs of Turing machines. Theor. Comput. Sci.\u00a0296, 195\u2013223 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N. Chomsky","year":"1959","unstructured":"Chomsky, N.: On certain formal properties of grammars. Inf. Control\u00a02, 137\u2013167 (1959)","journal-title":"Inf. Control"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45687-2_14","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D., Knapik, T.: A chomsky-like hierarchy of infinite graphs. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 177\u2013187. Springer, Heidelberg (2002)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Carayol, A., Meyer, A.: Context-sensitive languages, rational graphs and determinism. Submitted to publication, preliminary version (2005), available at http:\/\/www.irisa.fr\/galion\/acarayol\/","DOI":"10.2168\/LMCS-2(2:6)2006"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Carayol, A., Meyer, A.: Linearly bounded infinite graphs (extended version). Submitted to publication, preliminary version (2005), available at http:\/\/www.irisa.fr\/galion\/acarayol\/","DOI":"10.1007\/11549345_17"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C. Elgot","year":"1965","unstructured":"Elgot, C., Mezei, J.: On relations defined by finite automata. IBM J. Res. Develop.\u00a09, 47\u201368 (1965)","journal-title":"IBM J. Res. Develop."},{"issue":"5","key":"17_CR9","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N. Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput.\u00a017(5), 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-48321-7_30","volume-title":"Fundamentals of Computation Theory","author":"T. Knapik","year":"1999","unstructured":"Knapik, T., Payet, \u00c9.: Synchronized product of linear bounded machines. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 362\u2013373. Springer, Heidelberg (1999)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"S. Kuroda","year":"1964","unstructured":"Kuroda, S.: Classes of languages and linear-bounded automata. Inf. Control\u00a07, 207\u2013223 (1964)","journal-title":"Inf. Control"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0055778","volume-title":"Mathematical Foundations of Computer Science 1998","author":"M. Latteux","year":"1998","unstructured":"Latteux, M., Simplot, D., Terlutte, A.: Iterated length-preserving rational transductions. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 286\u2013295. Springer, Heidelberg (1998)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-46432-8_17","volume-title":"Foundation of Software Science and Computation Structures","author":"C. Morvan","year":"2000","unstructured":"Morvan, C.: On rational graphs. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 252\u2013266. Springer, Heidelberg (2000)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-44683-4_48","volume-title":"Mathematical Foundations of Computer Science 2001","author":"C. Morvan","year":"2001","unstructured":"Morvan, C., Stirling, C.: Rational graphs trace context-sensitive languages. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 548\u2013559. Springer, Heidelberg (2001)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Payet, \u00c9.: Thue Specifications, Infinite Graphs and Synchronized Product. PhD thesis, Universit\u00e9 de la R\u00e9union (2000)","DOI":"10.3233\/FUN-2000-44303"},{"key":"17_CR16","unstructured":"Stirling, C.: Decidability of bisimulation equivalence for pushdown processes. Technical Report EDI-INF-RR-0005, School of Informatics, University of Edinburgh (2000)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-46011-X_10","volume-title":"Developments in Language Theory","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: A short introduction to infinite automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 130\u2013144. Springer, Heidelberg (2002)"},{"issue":"5","key":"17_CR18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1051\/ita\/1996300503791","volume":"30","author":"A. Weber","year":"1996","unstructured":"Weber, A.: Decomposing a k-valued transducer into k unambiguous ones. Inf. Th\u00e9or. Appl.\u00a030(5), 379\u2013413 (1996)","journal-title":"Inf. Th\u00e9or. Appl."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:44:09Z","timestamp":1736005449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11549345_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}