{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:48:32Z","timestamp":1764557312777},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_27","type":"book-chapter","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T00:52:51Z","timestamp":1408323171000},"page":"303-314","source":"Crossref","is-referenced-by-count":4,"title":["Deterministic Set Automata"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(91)90053-5","volume":"85","author":"A. Cherubini","year":"1991","unstructured":"Cherubini, A., Citrini, C., Crespi-Reghizzi, S., Mandrioli, D.: QRT FIFO automata, breadth-first grammars and their relations. Theoret. Comput. Sci.\u00a085, 171\u2013203 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N. Chomsky","year":"1959","unstructured":"Chomsky, N.: On certain formal properties of grammars. Inform. Control\u00a02, 137\u2013167 (1959)","journal-title":"Inform. Control"},{"key":"27_CR3","first-page":"185","volume":"13","author":"M. Daley","year":"2008","unstructured":"Daley, M., Eramian, M.G., McQuillan, I.: The bag automaton: A model of nondeterministic storage. J. Autom., Lang. Comb.\u00a013, 185\u2013206 (2008)","journal-title":"J. Autom., Lang. Comb."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S. Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM\u00a014, 389\u2013418 (1967)","journal-title":"J. ACM"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/3-540-45061-0_40","volume-title":"Automata, Languages and Programming","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Flip-pushdown automata: k\u2009+\u20091 pushdown reversals are better than k. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 490\u2013501. Springer, Heidelberg (2003)"},{"key":"27_CR6","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-642-39274-0_21","volume-title":"CIAA 2013","author":"M. Kutrib","year":"2013","unstructured":"Kutrib, M., Malcher, A., Mereghetti, C., Palano, B., Wendlandt, M.: Input-driven queue automata: Finite turns, decidability, and closure properties. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol.\u00a07982, pp. 232\u2013243. Springer, Heidelberg (2013)"},{"key":"27_CR8","first-page":"159","volume-title":"5. Theorietag Automaten und Formale Sprachen","author":"K.-J. Lange","year":"1995","unstructured":"Lange, K.-J., Reinhardt, K.: Automaten mit der Datenstruktur Menge. In: Kutrib, M., Worsch, T. (eds.) 5. Theorietag Automaten und Formale Sprachen, pp. 159\u2013167. Universit\u00e4t Giessen, Giessen (1995)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/800169.805419","volume-title":"Proceedings of the First Annual ACM Symposium on Theory of Computing (STOC 1969)","author":"W.F. Ogden","year":"1969","unstructured":"Ogden, W.F.: Intercalation theorems for stack languages. In: Proceedings of the First Annual ACM Symposium on Theory of Computing (STOC 1969), pp. 31\u201342. ACM Press, New York (1969)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00285-1","volume":"251","author":"G. S\u00e9nizergues","year":"2001","unstructured":"S\u00e9nizergues, G.: L(A)\u2009=\u2009L(B)? decidability results from complete formal systems. Theoret. Comput. Sci.\u00a0251, 1\u2013166 (2001)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09698-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:13:44Z","timestamp":1558973624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}