{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:40:50Z","timestamp":1725543650502},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359074"},{"type":"electronic","value":"9783540359081"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11787006_40","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T19:23:09Z","timestamp":1151522589000},"page":"468-479","source":"Crossref","is-referenced-by-count":2,"title":["Communication of Two Stacks and Rewriting"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Kunc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B.S. Baker","year":"1974","unstructured":"Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences\u00a08, 315\u2013332 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"40_CR2","first-page":"1188","volume":"269","author":"M. Benois","year":"1969","unstructured":"Benois, M.: Parties rationnelles du groupe libre. C. R. Acad. Sci. Paris Series A\u00a0269, 1188\u20131190 (1969)","journal-title":"C. R. Acad. Sci. Paris Series A"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01969548","volume":"6","author":"J.R. B\u00fcchi","year":"1964","unstructured":"B\u00fcchi, J.R.: Regular canonical systems. Arch. Math. Logic Grundlagenforsch\u00a06, 91\u2013111 (1964)","journal-title":"Arch. Math. Logic Grundlagenforsch"},{"key":"40_CR4","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)"},{"issue":"3","key":"40_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.tcs.2004.04.009","volume":"327","author":"D. Hofbauer","year":"2004","unstructured":"Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. Theoretical Computer Science\u00a0327(3), 301\u2013317 (2004)","journal-title":"Theoretical Computer Science"},{"key":"40_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Karhum\u00e4ki, J., Kunc, M., Okhotin, A.: Computing by commuting. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2006.01.051"},{"key":"40_CR8","first-page":"1544","volume":"6","author":"M.I. Kratko","year":"1965","unstructured":"Kratko, M.I.: On a certain class of Post calculi. Soviet Math. Doklady\u00a06, 1544\u20131545 (1965)","journal-title":"Soviet Math. Doklady"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-540-31856-9_47","volume-title":"STACS 2005","author":"M. Kunc","year":"2005","unstructured":"Kunc, M.: The Power of Commuting with Finite Sets of Words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 569\u2013580. Springer, Heidelberg (2005)"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"E.L. Post","year":"1943","unstructured":"Post, E.L.: Formal reductions of the general combinatorial decision problem. American Journal of Mathematics\u00a065(2), 197\u2013215 (1943)","journal-title":"American Journal of Mathematics"},{"key":"40_CR11","unstructured":"Sakarovitch, J.: Elements de th\u00e9orie des automates, Vuibert (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11787006_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:20:15Z","timestamp":1619493615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11787006_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359074","9783540359081"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11787006_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}