{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:51Z","timestamp":1725905451303},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_20","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:37:57Z","timestamp":1500525477000},"page":"272-283","source":"Crossref","is-referenced-by-count":0,"title":["Deleting Deterministic Restarting Automata with Two Windows"],"prefix":"10.1007","author":[{"given":"Franti\u0161ek","family":"Mr\u00e1z","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner Studienb\u00fccher, Teubner-Verlag, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1997.2681","volume":"141","author":"G Buntrock","year":"1998","unstructured":"Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inf. Comput. 141, 1\u201316 (1998)","journal-title":"Inf. Comput."},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(86)90093-9","volume":"48","author":"M Chrobak","year":"1986","unstructured":"Chrobak, M.: Hierarchies of one-way multihead automata languages. Theor. Comput. Sci. 48, 153\u2013181 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(88)90004-9","volume":"37","author":"M Chrobak","year":"1988","unstructured":"Chrobak, M., Li, M.: $$k+1$$ heads are better than $$k$$ for PDAs. J. Comput. Syst. Sci. 37, 144\u2013155 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR5","doi-asserted-by":"crossref","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. Linguist. Philos. 19, 599\u2013617 (1996)","journal-title":"Linguist. Philos."},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/0022-0000(86)90062-0","volume":"33","author":"E Dahlhaus","year":"1986","unstructured":"Dahlhaus, E., Warmuth, M.: Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33, 456\u2013472 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.tcs.2005.11.012","volume":"354","author":"R Gramatovici","year":"2006","unstructured":"Gramatovici, R., Mart\u00edn-Vide, C.: Sorted dependency insertion grammars. Theor. Comput. Sci. 354, 142\u2013152 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.tcs.2010.08.024","volume":"412","author":"M Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: origins and directions. Theor. Comput. Sci. 412, 83\u201396 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-60249-6_60","volume-title":"Fundamentals of Computation Theory","author":"P Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283\u2013292. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60249-6_60"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-62844-4_8","volume-title":"New Trends in Formal Languages: Control, Cooperation, and Combinatorics","author":"P Jan\u010dar","year":"1997","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: On restarting automata with rewriting. In: P\u0103un, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 119\u2013136. Springer, Heidelberg (1997). doi: 10.1007\/3-540-62844-4_8"},{"key":"20_CR11","first-page":"287","volume":"4","author":"P Jan\u010dar","year":"1999","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: On monotonic automata with a restart operation. J. Autom. Lang. Comb. 4, 287\u2013311 (1999)","journal-title":"J. Autom. Lang. Comb."},{"key":"20_CR12","first-page":"407","volume":"9","author":"T Jurdzi\u0144ski","year":"2004","unstructured":"Jurdzi\u0144ski, T., Lory\u015b, K., Niemann, G., Otto, F.: Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages. J. Autom. Lang. Comb. 9, 407\u2013437 (2004)","journal-title":"J. Autom. Lang. Comb."},{"key":"20_CR13","first-page":"7","volume":"87","author":"M Lopatkov\u00e1","year":"2007","unstructured":"Lopatkov\u00e1, M., Pl\u00e1tek, M., Sgall, P.: Towards a formal model for functional generative description - analysis by reduction and restarting automata. The Prague Bull. Math. Linguist. 87, 7\u201326 (2007)","journal-title":"The Prague Bull. Math. Linguist."},{"key":"20_CR14","doi-asserted-by":"crossref","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 35, 324\u2013344 (1988)","journal-title":"J. ACM"},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/FI-2014-1083","volume":"133","author":"F Mr\u00e1z","year":"2014","unstructured":"Mr\u00e1z, F., Otto, F., Pl\u00e1tek, M.: Free word-order and restarting automata. Fundam. Inf. 133, 399\u2013419 (2014)","journal-title":"Fundam. Inf."},{"key":"20_CR16","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-33461-3_11","volume-title":"Recent Advances in Formal Languages and Applications","author":"F Otto","year":"2006","unstructured":"Otto, F.: Restarting automata. In: \u00c9sik, Z., Mart\u00edn-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269\u2013303. Springer, Heidelberg (2006). doi: 10.1007\/978-3-540-33461-3_11"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-88282-4_37","volume-title":"Language and Automata Theory and Applications","author":"F Otto","year":"2008","unstructured":"Otto, F., Pl\u00e1tek, M.: A two-dimensional taxonomy of proper languages of lexicalized FRR-automata. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 409\u2013420. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-88282-4_37"},{"key":"20_CR18","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.tcs.2010.10.017","volume":"412","author":"D Pardubsk\u00e1","year":"2011","unstructured":"Pardubsk\u00e1, D., Pl\u00e1tek, M., Otto, F.: Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. Theor. Comput. Sci. 412, 458\u2013477 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR19","unstructured":"Pl\u00e1tek, M., Mr\u00e1z, F., Lopatkov\u00e1, M.: (In)dependencies in functional generative description by restarting automata. In: Bordihn, H., Freund, R., Hinze, T., Holzer, M., Kutrib, M., Otto, F. (eds.) Proceedings of NCMA 2010. books@acg.at, vol. 263, pp. 155\u2013170. \u00d6sterreichische Computer Gesellschaft, Vienna (2010)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-13089-2_42","volume-title":"Language and Automata Theory and Applications","author":"M Pl\u00e1tek","year":"2010","unstructured":"Pl\u00e1tek, M., Mr\u00e1z, F., Lopatkov\u00e1, M.: Restarting automata with structured output and functional generative description. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 500\u2013511. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13089-2_42"},{"key":"20_CR21","first-page":"267","volume-title":"Perspectives on Sentence Processing","author":"O Rambow","year":"1994","unstructured":"Rambow, O., Joshi, A.: A processing model for free word order languages. In: Clifton, C., Frazier, L., Rayner, K. (eds.) Perspectives on Sentence Processing, pp. 267\u2013302. Lawrence Erlbaum Associates, Hillsdale (1994)"},{"key":"20_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(76)90426-5","volume":"30","author":"H Sudborough","year":"1976","unstructured":"Sudborough, H.: One-way multihead writing finite automata. Inf. Control 30, 1\u201320 (1976)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T21:19:34Z","timestamp":1602537574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}