{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:29:14Z","timestamp":1743049754620,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316432"},{"type":"electronic","value":"9783642316449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-31644-9_8","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T22:17:08Z","timestamp":1342649828000},"page":"111-137","source":"Crossref","is-referenced-by-count":0,"title":["On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"A Grammatical Approach to Distribution and Cooperation","volume-title":"Grammar Systems","author":"E. Csuhaj-Varj\u00fa","year":"1994","unstructured":"Csuhaj-Varj\u00fa, E., Dassow, J., Kelemen, J., P\u0103un, G.: Grammar Systems. A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/BF00632709","volume":"19","author":"C. Culy","year":"1996","unstructured":"Culy, C.: Formal properties of natural language and linguistic theories. Linguistics and Philosophy\u00a019, 599\u2013617 (1996)","journal-title":"Linguistics and Philosophy"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-662-07675-0_4","volume-title":"Handbook of Formal Languages","author":"J. Dassow","year":"1997","unstructured":"Dassow, J., P\u0103un, G., Rozenberg, G.: Grammar systems. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a02, pp. 155\u2013213. Springer, Berlin (1997)"},{"key":"8_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/2563","volume-title":"The Book of Traces","author":"V. Diekert","year":"1995","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)"},{"key":"8_CR5","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.tcs.2009.09.001","volume":"411","author":"O. Ibarra","year":"2009","unstructured":"Ibarra, O., Karhum\u00e4ki, J., Okhotin, A.: On stateless multihead automata: Hierarchies and the emptiness problem. Theoret. Comput. Sci.\u00a0411, 581\u2013593 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1142\/S0129054110007556","volume":"21","author":"M. Kutrib","year":"2010","unstructured":"Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. Int. J. Found. Comput. Sci.\u00a021, 781\u2013798 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00236-010-0125-4","volume":"47","author":"M. Kutrib","year":"2010","unstructured":"Kutrib, M., Messerschmidt, H., Otto, F.: On stateless deterministic restarting automata. Acta Inform.\u00a047, 391\u2013412 (2010)","journal-title":"Acta Inform."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1016\/j.ic.2008.03.016","volume":"206","author":"M. Kutrib","year":"2008","unstructured":"Kutrib, M., Reimann, J.: Succinct description of regular languages by weak restarting automata. Inform. Comput.\u00a0206, 1152\u20131160 (2008)","journal-title":"Inform. Comput."},{"key":"8_CR10","unstructured":"Lautemann, C.: One pushdown and a small tape. In: Dirk Siefkes zum 50.\u00a0Geburtstag, pp. 42\u201347. TU Berlin and Universit\u00e4t Augsburg (1988)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R. McNaughton","year":"1988","unstructured":"McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. ACM\u00a035, 324\u2013344 (1988)","journal-title":"J. ACM"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1142\/S0129054107005376","volume":"18","author":"H. Messerschmidt","year":"2007","unstructured":"Messerschmidt, H., Otto, F.: Cooperating distributed systems of restarting automata. Int. J. Found. Comput. Sci.\u00a018, 1333\u20131342 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-540-74240-1_37","volume-title":"Fundamentals of Computation Theory","author":"H. Messerschmidt","year":"2007","unstructured":"Messerschmidt, H., Otto, F.: Strictly Deterministic CD-Systems of Restarting Automata. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 424\u2013434. Springer, Heidelberg (2007)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-13089-2_39","volume-title":"Language and Automata Theory and Applications","author":"B. Nagy","year":"2010","unstructured":"Nagy, B., Otto, F.: CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 463\u2013474. Springer, Heidelberg (2010)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-21254-3_31","volume-title":"Language and Automata Theory and Applications","author":"B. Nagy","year":"2011","unstructured":"Nagy, B., Otto, F.: Globally Deterministic CD-Systems of Stateless R(1)-Automata. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 390\u2013401. Springer, Heidelberg (2011)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E.L. Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bull. AMS\u00a052, 264\u2013268 (1946)","journal-title":"Bull. AMS"},{"key":"8_CR17","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"8_CR18","unstructured":"Yang, L., Dang, Z., Ibarra, O.: On stateless automata and P systems. In: Workshop on Automata for Cellular and Molecular Computing, pp. 144\u2013157. MTA SZTAKI (2007)"}],"container-title":["Lecture Notes in Computer Science","Languages Alive"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31644-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:52:52Z","timestamp":1558299172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31644-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316432","9783642316449"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31644-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}