{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:07:09Z","timestamp":1725815229136},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_25","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T14:54:29Z","timestamp":1421247269000},"page":"302-313","source":"Crossref","is-referenced-by-count":1,"title":["Two Grammatical Equivalents of Flip-Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kostol\u00e1nyi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.ipl.2014.03.003","volume":"114","author":"P. \u010euri\u0161","year":"2014","unstructured":"\u010euri\u0161, P., Ko\u0161ta, M.: Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable. Inform. Process. Lett.\u00a0114, 417\u2013420 (2014)","journal-title":"Inform. Process. Lett."},{"key":"25_CR2","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":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-45007-6_29","volume-title":"Developments in Language Theory","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Flip-Pushdown Automata: Nondeterminism is Better than Determinism. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 361\u2013372. Springer, Heidelberg (2003)"},{"key":"25_CR4","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)","edition":"2"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00163-1","volume":"197","author":"A. Mateescu","year":"1998","unstructured":"Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theor. Comput. Sci.\u00a0197, 1\u201356 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR6","volume-title":"The Mathematical Theory of L Systems","author":"G. Rozenberg","year":"1980","unstructured":"Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, London (1980)"},{"key":"25_CR7","unstructured":"Sarkar, P.: Pushdown automaton with the ability to flip its stack. Report No. 81, Electronic Colloquium on Computational Complexity (2001)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T04:22:28Z","timestamp":1559103748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}