{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:17Z","timestamp":1759637957526},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_30","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T10:47:27Z","timestamp":1452163647000},"page":"369-380","source":"Crossref","is-referenced-by-count":8,"title":["On the Effects of Nondeterminism on Ordered Restarting Automata"],"prefix":"10.1007","author":[{"given":"Kent","family":"Kwee","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J-C Birget","year":"1992","unstructured":"Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Proc. Lett. 43, 185\u2013190 (1992)","journal-title":"Inform. Proc. Lett."},{"key":"30_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. Inform. Comp. 141, 1\u201336 (1998)","journal-title":"Inform. Comp."},{"key":"30_CR3","doi-asserted-by":"publisher","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."},{"issue":"1","key":"30_CR4","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"s3-2","author":"Graham Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 2, 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"30_CR5","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"4","key":"30_CR6","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s00224-014-9561-9","volume":"56","author":"Prateek Karandikar","year":"2014","unstructured":"Karandikar, P., Schnoebelen, Ph.: Generalized Post embedding problems. Theory Comput. Syst. 56, 697\u2013716 (2015)","journal-title":"Theory of Computing Systems"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-19225-3_14","volume-title":"Descriptional Complexity of Formal Systems","author":"K Kwee","year":"2015","unstructured":"Kwee, K., Otto, F.: On some decision problems for stateless deterministic ordered restarting automata. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 165\u2013176. Springer, Heidelberg (2015)"},{"key":"30_CR8","unstructured":"Lautemann, C.: One pushdown and a small tape. In: Wagner, K.W. (ed.) Dirk Siefkes zum 50. Geburtstag, pp. 42\u201347. Technische Universit\u00e4t Berlin and Universit\u00e4t Augsburg (1988)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-319-04298-5_38","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"F Mr\u00e1z","year":"2014","unstructured":"Mr\u00e1z, F., Otto, F.: Ordered restarting automata for picture languages. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 431\u2013442. Springer, Heidelberg (2014)"},{"key":"30_CR10","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. SCI, vol. 25, pp. 269\u2013303. Springer, Heidelberg (2006)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-319-09704-6_28","volume-title":"Descriptional Complexity of Formal Systems","author":"F Otto","year":"2014","unstructured":"Otto, F.: On the descriptional complexity of deterministic ordered restarting automata. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 318\u2013329. Springer, Heidelberg (2014)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-20860-2_4","volume-title":"Reversible Computation","author":"F Otto","year":"2015","unstructured":"Otto, F., Wendlandt, M., Kwee, K.: Reversible ordered restarting automata. In: Krevine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 60\u201375. Springer, Heidelberg (2015)"},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-642-22012-8_35","volume-title":"Automata, Languages and Programming","author":"S. Schmitz","year":"2011","unstructured":"Schmitz, S., Schnoebelen, Ph.: Multiply-recursive upper bounds with Higman\u2019s lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 441\u2013452. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:53:21Z","timestamp":1559364801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}