{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:25Z","timestamp":1725545065125},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_15","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T10:07:40Z","timestamp":1141207660000},"page":"176-187","source":"Crossref","is-referenced-by-count":0,"title":["Restricting the Use of Auxiliary Symbols for Restarting Automata"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Jurdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","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":"15_CR2","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a02807, pp. 82\u201389. Springer, Heidelberg (2003)"},{"key":"15_CR3","unstructured":"Pl\u00e1tek, M., Lopatkov\u00e1, M., Oliva, K.: Restarting automata: motivations and applications. In: Holzer, M. (ed.) Workshop \u2018Petrinetze\u2019 and 13. Theorietag Formale Sprachen und Automaten, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, pp. 90\u201396 (2003)"},{"key":"15_CR4","first-page":"103","volume-title":"Developments in Language Theory - Foundations, Applications, and Perspectives, DLT 1999","author":"G. Niemann","year":"2000","unstructured":"Niemann, G., Otto, F.: Restarting automata, Church-Rosser languages, and representations of r.e.languages. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory - Foundations, Applications, and Perspectives, DLT 1999, pp. 103\u2013114. World Scientific, Singapore (2000)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1142\/9789812704979_0027","volume-title":"Words, Languages and Combinatorics III","author":"G. Niemann","year":"2003","unstructured":"Niemann, G., Otto, F.: Further results on restarting automata. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, pp. 352\u2013369. World Scientific, Singapore (2003)"},{"key":"15_CR6","first-page":"324","volume":"35","author":"R. McNaughton","year":"1988","unstructured":"McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J.\u00a0Assoc.\u00a0Comput.\u00a0Mach.\u00a035, 324\u2013344 (1988)","journal-title":"J.\u00a0Assoc.\u00a0Comput.\u00a0Mach."},{"key":"15_CR7","first-page":"283","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.\u00a0Autom.\u00a0Lang.\u00a0Comb.\u00a04, 283\u2013292 (1999)","journal-title":"J.\u00a0Autom.\u00a0Lang.\u00a0Comb."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, T., Otto, F.: Restarting automata with restricted utilization of auxiliary symbols. Mathematische Schriften Kassel 2\/05, Universit\u00e4t Kassel (2005)","DOI":"10.1016\/j.tcs.2006.07.023"},{"key":"15_CR9","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":"15_CR10","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":"15_CR11","unstructured":"Pl\u00e1tek, M., Otto, F., Mr\u00e1z, F., Jurdzi\u0144ski, T.: Restarting automata and variants of j-monotonicity. Mathematische Schriften Kassel 9\/03, Universit\u00e4t Kassel (2003)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-30550-7_20","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 the complexity of 2-monotone restarting automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 237\u2013248. Springer, Heidelberg (2004)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-45007-6_26","volume-title":"Developments in Language Theory","author":"L. Hemaspaandra","year":"2003","unstructured":"Hemaspaandra, L., Mukherji, P., Tantau, T.: Computation with absolutely no space overhead. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 325\u2013336. Springer, Heidelberg (2003)"},{"key":"15_CR14","unstructured":"Hemaspaandra, L., Mukherji, P., Tantau, T.: Overhead-free computation, dcfls, and cfls. In: The Computing Research Repository cs.\u00a0CC\/0410035 (2004)"},{"key":"15_CR15","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, London (1973)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:05:14Z","timestamp":1619492714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11605157_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}