{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:17:36Z","timestamp":1725517056863},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853602"},{"type":"electronic","value":"9783540853619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85361-9_9","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T12:28:04Z","timestamp":1219062484000},"page":"67-81","source":"Crossref","is-referenced-by-count":14,"title":["R-Automata"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Krcal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-71389-0_2","volume-title":"Foundations of Software Science and Computational Structures","author":"P.A. Abdulla","year":"2007","unstructured":"Abdulla, P.A., Krcal, P., Yi, W.: Sampled universality of timed automata. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 2\u201316. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Krcal, P., Yi, W.: R-automata. Technical Report 2008-015, IT Department, Uppsala University (June 2008)","key":"9_CR2","DOI":"10.1007\/978-3-540-85361-9_9"},{"key":"9_CR3","first-page":"285","volume-title":"Proc. of LICS 2006","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Bounds in omega-regularity. In: Proc. of LICS 2006, pp. 285\u2013296. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-74240-1_20","volume-title":"Fundamentals of Computation Theory","author":"T. Colcombet","year":"2007","unstructured":"Colcombet, T.: Factorisation forests for infinite words. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 226\u2013237. Springer, Heidelberg (2007)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/978-3-540-70583-3_33","volume-title":"Proc. of ICALP 2008","author":"T. Colcombet","year":"2008","unstructured":"Colcombet, T., L\u00f6ding, C.: The non-deterministic Mostowski hierarchy and distance-parity automata. In: Proc. of ICALP 2008. LNCS, vol.\u00a05126, pp. 398\u2013409. Springer, Heidelberg (2008)"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashiguchi","year":"1982","unstructured":"Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. Journal of Computer and System Sciences\u00a024(2), 233\u2013244 (1982)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(90)90044-I","volume":"72","author":"K. Hashiguchi","year":"1990","unstructured":"Hashiguchi, K.: Improved limitedness theorems on finite automata with distance functions. Theoretical Computer Science\u00a072(1), 27\u201338 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1051\/ita:2005027","volume":"39","author":"D. Kirsten","year":"2005","unstructured":"Kirsten, D.: Distance desert automata and the star height problem. Informatique Theorique et Applications\u00a039(3), 455\u2013509 (2005)","journal-title":"Informatique Theorique et Applications"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11590156_25","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"P. Krcal","year":"2005","unstructured":"Krcal, P., Pelanek, R.: On sampled semantics of timed systems. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 310\u2013321. Springer, Heidelberg (2005)"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(91)90321-R","volume":"81","author":"H. Leung","year":"1991","unstructured":"Leung, H.: Limitedness theorem on finite automata with distance functions: an algebraic proof. Theoretical Computer Science\u00a081(1), 137\u2013145 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I. Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theoretical Computer Science\u00a072(1), 65\u201394 (1990)","journal-title":"Theoretical Computer Science"},{"issue":"3-4","key":"9_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1051\/ita\/1994283-402771","volume":"28","author":"I. Simon","year":"1994","unstructured":"Simon, I.: On semigroups of matrices over the tropical semiring. Informatique Theorique et Applications\u00a028(3-4), 277\u2013294 (1994)","journal-title":"Informatique Theorique et Applications"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2008 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85361-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T11:47:21Z","timestamp":1557748041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85361-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540853602","9783540853619"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85361-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}