{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:14:39Z","timestamp":1742966079989,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198045"},{"type":"electronic","value":"9783642198052"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19805-2_15","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T09:05:14Z","timestamp":1300093514000},"page":"214-228","source":"Crossref","is-referenced-by-count":0,"title":["Regularity and Context-Freeness over Word Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Didier","family":"Caucal","sequence":"first","affiliation":[]},{"given":"Trong Hieu","family":"Dinh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-88282-4_6","volume-title":"Language and Automata Theory and Applications","author":"J. Altenbernd","year":"2008","unstructured":"Altenbernd, J.: On bifix systems and generalizations. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 40\u201351. Springer, Heidelberg (2008)"},{"key":"15_CR2","unstructured":"Altenbernd, J.: Reachability over word rewriting systems. Ph.D. Thesis, RWTH Aachen, Germany (2009)"},{"key":"15_CR3","first-page":"1188","volume":"269","author":"M. Benois","year":"1969","unstructured":"Benois, M.: Parties rationnelles du groupe libre. C.R. Acad\u00e9mie des Sciences, S\u00e9rie A\u00a0269, 1188\u20131190 (1969)","journal-title":"C.R. Acad\u00e9mie des Sciences, S\u00e9rie A"},{"key":"15_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and context-free languages. Teubner, Stuttgart (1979)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(82)90036-6","volume":"19","author":"R. Book","year":"1982","unstructured":"Book, R., Jantzen, M., Wrathall, C.: Monadic thue systems. Theoretical Computer Science\u00a019, 231\u2013251 (1982)","journal-title":"Theoretical Computer Science"},{"key":"15_CR6","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-rewriting systems","author":"R. Book","year":"1993","unstructured":"Book, R., Otto, F.: String-rewriting systems. Texts and Monographs in Computer Science. Springer, Heidelberg (1993)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/11539452_36","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., M\u00fcller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 473\u2013487. Springer, Heidelberg (2005)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01969548","volume":"6","author":"R. B\u00fcchi","year":"1964","unstructured":"B\u00fcchi, R.: Regular canonical systems. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung\u00a06, 91\u2013111 (1964)","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","first-page":"61","volume-title":"CAAP \u201990","author":"D. Caucal","year":"1990","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. Theoretical Computer Science\u00a0106, 61\u201386 (1992); originally published In: Arnold, A. (ed.) CAAP 1990. LNCS, vol.\u00a0431, pp. 61\u201386. Springer, Heidelberg (1990)"},{"key":"15_CR10","unstructured":"Endrullis, J., Hofbauer, D., Waldmann, J.: Decomposing terminating rewrite relations. In: Geser, A., Sondergaard, H. (eds.) Proc. 8\n                    th\n                   WST, pp. 39\u201343 (2006), \n                    \n                      http:\/\/www.acm.org\/corr\/\n                    \n                    \n                  , Computing Research Repository"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00200-004-0162-8","volume":"15","author":"A. Geser","year":"2004","unstructured":"Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. Applicable Algebra in Engineering, Communication and Computing\u00a015, 149\u2013171 (2004)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1145\/321832.321842","volume":"21","author":"T. Hibbard","year":"1974","unstructured":"Hibbard, T.: Context-limited grammars. JACM\u00a021(3), 446\u2013453 (1974)","journal-title":"JACM"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-45007-6_27","volume-title":"Developments in Language Theory","author":"D. Hofbauer","year":"2003","unstructured":"Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. Theoretical Computer Science\u00a0327, 301\u2013317 (2004); originally published In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 301\u2013317. Springer, Heidelberg (2003)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-18740-5_45","volume-title":"Fundamentals of Computation Theory","author":"M. Jantzen","year":"1987","unstructured":"Jantzen, M., Kudlek, M., Lange, K.J., Petersen, H.: Dyck1-reductions of context-free languages. In: Budach, L., Bakharajev, R., Lipanov, O. (eds.) FCT 1987. LNCS, vol.\u00a0278, pp. 218\u2013227. Springer, Heidelberg (1987)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.051","volume":"356","author":"J. Karhum\u00e4ki","year":"2006","unstructured":"Karhum\u00e4ki, J., Kunc, M., Okhotin, A.: Computing by commuting. Theoretical Computer Science\u00a0356, 200\u2013211 (2006)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19805-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:49:52Z","timestamp":1558421392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19805-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198045","9783642198052"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19805-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}