{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:08Z","timestamp":1725491408230},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_18","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T05:32:31Z","timestamp":1155101551000},"page":"186-197","source":"Crossref","is-referenced-by-count":0,"title":["Forgetting Automata and Unary Languages"],"prefix":"10.1007","author":[{"given":"Jens","family":"Gl\u00f6ckler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","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":"18_CR2","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":"18_CR3","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":"18_CR4","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":"18_CR5","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":"18_CR6","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":"18_CR7","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":"18_CR8","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":"18_CR9","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M.: Forgetting automata and the Chomsky hierarchy. In: Proc. SOFSEM 1992, pp. 41\u201344 (1992)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0019-9958(75)80002-7","volume":"29","author":"S.A. Greibach","year":"1975","unstructured":"Greibach, S.A.: Erasable context-free languages. Information and Control\u00a029, 301\u2013326 (1975)","journal-title":"Information and Control"},{"key":"18_CR11","first-page":"67","volume":"14","author":"B. Monien","year":"1980","unstructured":"Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO \u2013 Theoretical Informatics and Applications\u00a014, 67\u201382 (1980)","journal-title":"RAIRO \u2013 Theoretical Informatics and Applications"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0304-3975(93)90028-R","volume":"112","author":"O.H. Ibarra","year":"1993","unstructured":"Ibarra, O.H., Tr\u00e2n, N.Q.: A note on simple programs with two variables. Theoretical Computer Science\u00a0112, 391\u2013397 (1993)","journal-title":"Theoretical Computer Science"},{"key":"18_CR13","unstructured":"Mr\u00e1z, F., Pl\u00e1tek, M.: A remark about forgetting automata. In: Proc. SOFSEM 1993, pp. 63\u201366 (1993)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:26:55Z","timestamp":1619494015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11812128_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}