{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:44:30Z","timestamp":1794339870431,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_26","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"247-258","source":"Crossref","is-referenced-by-count":7,"title":["On Nonforgetting Restarting Automata That Are Deterministic and\/or Monotone"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Messerschmidt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-09118-1_11","volume-title":"Theoretical Computer Science","author":"B. Braunm\u00fchl von","year":"1979","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Finite-change automata. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol.\u00a067, pp. 91\u2013100. Springer, Heidelberg (1979)"},{"key":"26_CR2","doi-asserted-by":"publisher","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. Information and Computation\u00a0141, 1\u201336 (1998)","journal-title":"Information and Computation"},{"key":"26_CR3","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"26_CR4","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.\u00a0965, pp. 283\u2013292. Springer, Heidelberg (1995)"},{"key":"26_CR5","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.\u00a0Automata, Languages and Combinatorics\u00a04, 287\u2013311 (1999)","journal-title":"J.\u00a0Automata, Languages and Combinatorics"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11505877_25","volume-title":"Developments in Language Theory","author":"T. Jurdzi\u0144ski","year":"2005","unstructured":"Jurdzi\u0144ski, T., Mr\u00e1z, F., Otto, F., Pl\u00e1tek, M.: Monotone deterministic RL-automata don\u2019t need auxiliary symbols. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 284\u2013295. Springer, Heidelberg (2005)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/11549345_46","volume-title":"Mathematical Foundations of Computer Science 2005","author":"T. Jurdzi\u0144ski","year":"2005","unstructured":"Jurdzi\u0144ski, T., Otto, F.: Shrinking restarting automata. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 532\u2013543. Springer, Heidelberg (2005)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-30550-7_21","volume-title":"Developments in Language Theory","author":"T. Jurdzi\u0144ski","year":"2004","unstructured":"Jurdzi\u0144ski, T., Otto, F., Mr\u00e1z, F., Pl\u00e1tek, M.: On left-monotone deterministic restarting automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 249\u2013260. Springer, Heidelberg (2004)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-39398-6_12","volume-title":"Text, Speech and Dialogue","author":"K. Oliva","year":"2003","unstructured":"Oliva, K., Kv\u011bto\u0148, P., Ondru\u0161ka, R.: The computational complexity of rule-based part-of-speech tagging. In: Matou\u0161ek, V., Mautner, P. (eds.) TSD 2003. LNCS, vol.\u00a02807, pp. 82\u201389. Springer, Heidelberg (2003)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-45007-6_5","volume-title":"Developments in Language Theory","author":"F. Otto","year":"2003","unstructured":"Otto, F.: Restarting automata and their relations to the Chomsky hierarchy. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 55\u201374. Springer, Heidelberg (2003)"},{"key":"26_CR11","unstructured":"Otto, F.: Restarting Automata - Notes for a Course at the 3rd International PhD School in Formal Languages and Applications. Mathematische Schriften Kassel 6\/04, Universit\u00e4t Kassel (2004)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45627-9_28","volume-title":"SOFSEM 2001: Theory and Practice of Informatics","author":"M. Pl\u00e1tek","year":"2001","unstructured":"Pl\u00e1tek, M.: Two-way restarting automata and j-monotonicity. In: Pacholski, L., Ru\u017ei\u010dka, P. (eds.) SOFSEM 2001. LNCS, vol.\u00a02234, pp. 316\u2013325. Springer, Heidelberg (2001)"},{"key":"26_CR13","unstructured":"Pl\u00e1tek, M., Lopatkov\u00e1, M., Oliva, K.: Restarting automata: motivations and applications. In: Holzer, M. (ed.) Workshop \u2018Petrinetze\u2019 and 13.\u00a0Theorietag \u2018Formale Sprachen und Automaten\u2019, Proc., Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, pp. 90\u201396 (2003)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:35Z","timestamp":1619492615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11753728_26","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}