{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:04Z","timestamp":1725890344242},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316227"},{"type":"electronic","value":"9783642316234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_18","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T05:03:34Z","timestamp":1341810214000},"page":"236-243","source":"Crossref","is-referenced-by-count":0,"title":["An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Meduna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luk\u00e1\u0161","family":"Vr\u00e1bel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Zemek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-4","key":"18_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.3233\/FI-2011-531","volume":"110","author":"\u00d6. E\u011fecio\u011flu","year":"2011","unstructured":"E\u011fecio\u011flu, \u00d6., Heged\u00fcs, L., Nagy, B.: Hierarchies of stateless multicounter 5\u2019 \u2192 3\u2019 Watson-Crick automata languages. Fundamenta Informaticae\u00a0110(1-4), 111\u2013123 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-21501-8_58","volume-title":"Advances in Computational Intelligence","author":"B. Nagy","year":"2011","unstructured":"Nagy, B., Heged\u00fcs, L., E\u011fecio\u011flu, \u00d6.: Hierarchy Results on Stateless Multicounter 5\u2032 \u2192 3\u2032 Watson-Crick Automata. In: Cabestany, J., Rojas, I., Joya, G. (eds.) IWANN 2011, Part I. LNCS, vol.\u00a06691, pp. 465\u2013472. Springer, Heidelberg (2011)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-03073-4_19","volume-title":"Mathematical Theory and Computational Practice","author":"\u00d6. E\u011fecio\u011flu","year":"2009","unstructured":"E\u011fecio\u011flu, \u00d6., Ibarra, O.H.: On Stateless Multicounter Machines. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol.\u00a05635, pp. 178\u2013187. Springer, Heidelberg (2009)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-02737-6_19","volume-title":"Developments in Language Theory","author":"P. Frisco","year":"2009","unstructured":"Frisco, P., Ibarra, O.H.: On Stateless Multihead Finite Automata and Multihead Pushdown Automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 240\u2013251. Springer, Heidelberg (2009)"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0304-3975(81)90055-4","volume":"14","author":"J.H. Gallier","year":"1981","unstructured":"Gallier, J.H.: DPDA\u2019s in \u2019atomic normal form\u2019 and applications to equivalence problems. Theoretical Computer Science\u00a014(2), 155\u2013186 (1981)","journal-title":"Theoretical Computer Science"},{"key":"18_CR6","volume-title":"Introduction to Formal Language Theory","author":"M. Harrison","year":"1978","unstructured":"Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-540-78773-0_9","volume-title":"LATIN 2008: Theoretical Informatics","author":"O.H. Ibarra","year":"2008","unstructured":"Ibarra, O.H., Karhum\u00e4ki, J., Okhotin, A.: On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 94\u2013105. Springer, Heidelberg (2008)"},{"issue":"7","key":"18_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00236-010-0125-4","volume":"47","author":"M. Kutrib","year":"2010","unstructured":"Kutrib, M., Messerschmidt, H., Otto, F.: On stateless deterministic restarting automata. Acta Informatica\u00a047(7), 391\u2013412 (2010)","journal-title":"Acta Informatica"},{"issue":"5","key":"18_CR9","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1142\/S0129054110007556","volume":"21","author":"M. Kutrib","year":"2010","unstructured":"Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. International Journal of Foundations of Computer Science\u00a021(5), 781\u2013798 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9781420063257","volume-title":"Elements of Compiler Design","author":"A. Meduna","year":"2007","unstructured":"Meduna, A.: Elements of Compiler Design. Auerbach Publications, Boston (2007)"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0019-9958(78)90139-0","volume":"38","author":"M. Oyamaguchi","year":"1978","unstructured":"Oyamaguchi, M., Honda, N.: The decidability of equivalence for deterministic stateless pushdown automata. Information and Control\u00a038(3), 367\u2013376 (1978)","journal-title":"Information and Control"},{"key":"18_CR12","unstructured":"Valiant, L.G.: Decision procedures for families of deterministic pushdown automata. Research Report CS-RR-001, Department of Computer Science, University of Warwick, Coventry, UK (1973)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and P systems. International Journal of Foundations of Computer Science, 1259\u20131276 (2008)","DOI":"10.1142\/S0129054108006261"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31623-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:40:36Z","timestamp":1620128436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}