{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:51:41Z","timestamp":1753440701779},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_32","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"389-400","source":"Crossref","is-referenced-by-count":3,"title":["On Visibly Pushdown Trace Languages"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I. Aalbersberg","year":"1988","unstructured":"Aalbersberg, I., Rozenberg, G.: Theory of traces. Theoret. Comput. Sci.\u00a060, 1\u201382 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004, pp. 202\u2013211. ACM Press (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-30550-7_9","volume-title":"Developments in Language Theory","author":"H. Bordihn","year":"2004","unstructured":"Bordihn, H., Holzer, M., Kutrib, M.: Input reversals and iterated pushdown automata: a new characterization of Khabbaz geometric hierarchy of languages. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 102\u2013113. Springer, Heidelberg (2004)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0890-5401(89)90051-5","volume":"82","author":"A. Bertoni","year":"1989","unstructured":"Bertoni, A., Mauri, G., Sabadini, N.: Membership problems for regular and context-free trace languages. Inform. Comput.\u00a082, 135\u2013150 (1989)","journal-title":"Inform. Comput."},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-00596-1_29","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Bollig","year":"2009","unstructured":"Bollig, B., Grindei, M.L., Habermehl, P.: Realizability of concurrent recursive programs. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 410\u2013424. Springer, Heidelberg (2009)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-12689-9_92","volume-title":"Foundations of Computation Theory","author":"B. Braunm\u00fchl","year":"1983","unstructured":"Braunm\u00fchl, B., von Verbeek, R.: Input-driven languages are recognized in log n space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 40\u201351. Springer, Heidelberg (1983)"},{"key":"32_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/9789814261456","volume-title":"The Book of Traces","author":"V. Diekert","year":"1995","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)"},{"key":"32_CR8","first-page":"257","volume-title":"Proc. Automata and Formal Languages, AFL 2008","author":"M. Kutrib","year":"2008","unstructured":"Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) Proc. Automata and Formal Languages, AFL 2008, pp. 257\u2013268. Computer and Automation Research Institute, Hungarian Academy of Sciences (2008)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1142\/S0129054107005376","volume":"18","author":"H. Messerschmidt","year":"2007","unstructured":"Messerschmidt, H., Otto, F.: Cooperating distributed systems of restarting automata. Intern. J. Found. Comput. Sci.\u00a018, 1333\u20131342 (2007)","journal-title":"Intern. J. Found. Comput. Sci."},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-13089-2_39","volume-title":"Language and Automata Theory and Applications","author":"B. Nagy","year":"2010","unstructured":"Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata accept all rational trace languages. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 463\u2013474. Springer, Heidelberg (2010)"},{"key":"32_CR12","first-page":"780","volume":"78","author":"B. Nagy","year":"2012","unstructured":"Nagy, B., Otto, F.: On CD-systems of stateless deterministic R-automata with window size one. JCSS\u00a078, 780\u2013806 (2012)","journal-title":"JCSS"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-18381-2_34","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"B. Nagy","year":"2011","unstructured":"Nagy, B., Otto, F.: An automata-theoretical characterization of context-free trace languages. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 406\u2013417. Springer, Heidelberg (2011)"},{"key":"32_CR14","first-page":"413","volume":"45","author":"B. Nagy","year":"2011","unstructured":"Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO\u00a045, 413\u2013448 (2011)","journal-title":"RAIRO"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00236-012-0175-x","volume":"50","author":"B. Nagy","year":"2013","unstructured":"Nagy, B., Otto, F.: Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Acta Inform.\u00a050, 229\u2013255 (2013)","journal-title":"Acta Inform."},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1080\/00207160.2012.688820","volume":"90","author":"B. Nagy","year":"2013","unstructured":"Nagy, B., Otto, F.: Globally deterministic CD-systems of stateless R-automata with window size\u00a01. Intern.\u00a0J.\u00a0Comput.\u00a0Math.\u00a090, 1254\u20131277 (2013)","journal-title":"Intern.\u00a0J.\u00a0Comput.\u00a0Math."},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11874683_6","volume-title":"Computer Science Logic","author":"J. Srba","year":"2006","unstructured":"Srba, J.: Visibly pushdown automata: From language equivalence to simulation and bisimulation. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 89\u2013103. Springer, Heidelberg (2006)"},{"key":"32_CR18","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. RAIRO\u00a021, 99\u2013135 (1987)","journal-title":"RAIRO"}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:58:29Z","timestamp":1559087909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}