{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:10:57Z","timestamp":1743127857428,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_29","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"371-382","source":"Crossref","is-referenced-by-count":0,"title":["A Taxonomy of Deterministic Forgetting Automata"],"prefix":"10.1007","author":[{"given":"Jens","family":"Gl\u00f6ckler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M.: Forgetting automata and the Chomsky hierarchy. In: Proc. SOFSEM 1992, pp. 41\u201344. Masaryk University, Brno, Institute of Computer Science (1992)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/3-540-57182-5_44","volume-title":"Mathematical Foundations of Computer Science 1993","author":"P. Jan\u010dar","year":"1993","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M.: A taxonomy of forgetting automata. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 527\u2013536. Springer, Heidelberg (1993)"},{"key":"29_CR3","first-page":"67","volume":"1","author":"P. Jan\u010dar","year":"1993","unstructured":"Jan\u010dar, P.: Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. Acta Mathematica et Informatica Universitatis Ostraviensis\u00a01, 67\u201374 (1993)","journal-title":"Acta Mathematica et Informatica Universitatis Ostraviensis"},{"key":"29_CR4","unstructured":"Mr\u00e1z, F., Pl\u00e1tek, M.: A remark about forgetting automata. In: Proc. SOFSEM 1993, pp. 63\u201366. Masaryk University, Brno, Institute of Computer Science (1993)"},{"key":"29_CR5","first-page":"77","volume":"3","author":"F. Mr\u00e1z","year":"1995","unstructured":"Mr\u00e1z, F., Pl\u00e1tek, M.: Erasing automata recognize more than context-free languages. Acta Mathematica et Informatica Universitatis Ostraviensis\u00a03, 77\u201385 (1995)","journal-title":"Acta Mathematica et Informatica Universitatis Ostraviensis"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s002360050050","volume":"33","author":"P. Jan\u010dar","year":"1996","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M.: Forgetting automata and context-free languages. Acta Informatica\u00a033, 409\u2013420 (1996)","journal-title":"Acta Informatica"},{"key":"29_CR7","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. von Braunm\u00fchl","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":"29_CR8","series-title":"Lecture Notes in Computer Science","first-page":"305","volume-title":"Mathematical Foundations of Computer Science 1992","author":"P. Jan\u010dar","year":"1992","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M.: Characterization of context-free languages by erasing automata. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol.\u00a0629, pp. 305\u2013314. Springer, Heidelberg (1992)"},{"key":"29_CR9","first-page":"27","volume":"45","author":"M. Pl\u00e1tek","year":"1986","unstructured":"Pl\u00e1tek, M., Vogel, J.: Deterministic list automata and erasing graphs. The Prague bulletin of mathematical linguistics\u00a045, 27\u201350 (1986)","journal-title":"The Prague bulletin of mathematical linguistics"},{"key":"29_CR10","first-page":"23","volume":"27","author":"M.P. Chytil","year":"1985","unstructured":"Chytil, M.P., Pl\u00e1tek, M., Vogel, J.: A note on the Chomsky hierarchy. Bulletin of the EATCS\u00a027, 23\u201330 (1985)","journal-title":"Bulletin of the EATCS"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1142\/S0129054107004991","volume":"18","author":"J. Gl\u00f6ckler","year":"2007","unstructured":"Gl\u00f6ckler, J.: Forgetting automata and unary languages. International Journal of Foundations of Computer Science\u00a018, 813\u2013827 (2007)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/3-540-57163-9_25","volume-title":"Fundamentals of Computation Theory","author":"M. Holzer","year":"1993","unstructured":"Holzer, M., Lange, K.J.: On the complexities of linear LL(1) and LR(1) grammars. In: \u00c9sik, Z. (ed.) FCT 1993. LNCS, vol.\u00a0710, pp. 299\u2013308. Springer, Heidelberg (1993)"},{"key":"29_CR13","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":"29_CR14","unstructured":"Gl\u00f6ckler, J.: Closure properties of the families of languages accepted by forgetting automata. In: Proc. MEMICS 2007, pp. 51\u201358 (2007)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T22:09:32Z","timestamp":1675894172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}