{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:38Z","timestamp":1725474638219},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_36","type":"book-chapter","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T04:48:02Z","timestamp":1164689282000},"page":"393-404","source":"Crossref","is-referenced-by-count":0,"title":["Branching Pushdown Tree Automata"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swarat","family":"Chaudhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Draft (2002)"},{"issue":"1-2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown tree automata. Math. Systems Theory\u00a016(4), 237\u2013263 (1983)","journal-title":"Math. Systems Theory"},{"issue":"2","key":"36_CR4","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1006\/inco.1994.1073","volume":"113","author":"D. Harel","year":"1994","unstructured":"Harel, D., Raz, D.: Deciding emptiness for stack automata on infinite trees. Information and Computation\u00a0113(2), 278\u2013299 (1994)","journal-title":"Information and Computation"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume-title":"CONCUR \u201996: Concurrency Theory","author":"D. Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 263\u2013277. Springer, Heidelberg (1996)"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-36078-6_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"O. Kupferman","year":"2002","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: Pushdown specifications. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS, vol.\u00a02514, pp. 262\u2013277. Springer, Heidelberg (2002)"},{"issue":"3","key":"36_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Mathematical Systems Theory\u00a04(3), 257\u2013287 (1970)","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"36_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0129054192000048","volume":"3","author":"A. Saoudi","year":"1992","unstructured":"Saoudi, A.: Pushdown automata on infinite trees and nondeterministic context-free programs. International Journal of Foundations of Comp. Sci.\u00a03(1), 21\u201339 (1992)","journal-title":"International Journal of Foundations of Comp. Sci."},{"issue":"1","key":"36_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0022-0000(85)90002-9","volume":"30","author":"K.M. Schimpf","year":"1985","unstructured":"Schimpf, K.M., Gallier, J.H.: Tree pushdown automata. Journal of Computer and System Sciences\u00a030(1), 25\u201340 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume":"III","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. Handbook of Formal Language Theory\u00a0III, 389\u2013455 (1997)","journal-title":"Handbook of Formal Language Theory"},{"issue":"2","key":"36_CR11","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model-checking. Information and Computation\u00a0164(2), 234\u2013263 (2001)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:51Z","timestamp":1619507871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11944836_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}