{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:04:59Z","timestamp":1740096299829,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393099"},{"type":"electronic","value":"9783642393105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39310-5_23","type":"book-chapter","created":{"date-parts":[[2013,6,13]],"date-time":"2013-06-13T21:33:15Z","timestamp":1371159195000},"page":"241-252","source":"Crossref","is-referenced-by-count":2,"title":["The Power of Centralized PC Systems of Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Holger","family":"Petersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Sakthi Balan, M.: Serializing the parallelism in parallel communicating pushdown automata systems. In: Dassow, J., Pighizzini, G., Truthe, B. (eds.) 11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, pp. 59\u201368 (2009), \n                  \n                    http:\/\/dx.doi.org\/10.4204\/EPTCS.3.5","DOI":"10.4204\/EPTCS.3.5"},{"issue":"3","key":"23_CR2","first-page":"401","volume":"8","author":"M. Sakthi Balan","year":"2003","unstructured":"Sakthi Balan, M., Krithivasan, K., Mutyam, M.: Some variants in communication of parallel communicating pushdown automata. Journal of Automata, Languages and Combinatorics\u00a08(3), 401\u2013416 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(86)90093-9","volume":"48","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Hierarchies of one-way multihead automata languages. Theor. Comput. Sci.\u00a048(3), 153\u2013181 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-0000(88)90004-9","volume":"37","author":"M. Chrobak","year":"1988","unstructured":"Chrobak, M., Li, M.: k\u2009+\u20091 heads are better than k for PDAs. J. Comput. Syst. Sci.\u00a037(2), 144\u2013155 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1142\/S0129054100000338","volume":"11","author":"E. Csuhaj-Varj\u00fa","year":"2000","unstructured":"Csuhaj-Varj\u00fa, E., Mart\u00edn-Vide, C., Mitrana, V., Vaszil, G.: Parallel communicating pushdown automata systems. Int. J. Found. Comput. Sci.\u00a011(4), 633\u2013650 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"23_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","volume":"13","author":"M.A. Harrison","year":"1968","unstructured":"Harrison, M.A., Ibarra, O.H.: Multi-tape and multi-head pushdown automata. Inform. and Control\u00a013(5), 433\u2013470 (1968)","journal-title":"Inform. and Control"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","volume":"3","author":"O.H. Ibarra","year":"1974","unstructured":"Ibarra, O.H.: A note on semilinear sets and bounded-reversal multihead pushdown automata. Inform. Process. Lett.\u00a03(1), 25\u201328 (1974)","journal-title":"Inform. Process. Lett."},{"key":"23_CR8","volume-title":"Computation: Finite and Infinite Machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-31623-4_19","volume-title":"Descriptional Complexity of Formal Systems","author":"F. Otto","year":"2012","unstructured":"Otto, F.: Centralized PC systems of pushdown automata versus multi-head pushdown automata. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol.\u00a07386, pp. 244\u2013251. Springer, Heidelberg (2012)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-37064-9_40","volume-title":"Language and Automata Theory and Applications","author":"F. Otto","year":"2013","unstructured":"Otto, F.: Asynchronous PC systems of pushdown automata. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol.\u00a07810, pp. 456\u2013467. Springer, Heidelberg (2013)"},{"key":"23_CR11","volume-title":"Computational Complexity","author":"K. Wagner","year":"1986","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. D.\u00a0Reidel Publishing Company, Dordrecht (1986)"}],"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-39310-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:00:30Z","timestamp":1557792030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}