{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:33Z","timestamp":1771024233520,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540354284","type":"print"},{"value":"9783540354307","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_12","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T01:55:49Z","timestamp":1150854949000},"page":"120-132","source":"Crossref","is-referenced-by-count":16,"title":["Synchronization of Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Didier","family":"Caucal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) 36th\u00a0STOC, ACM Proceedings, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, R.: Regular canonical systems. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung\u00a06, 91\u2013111 (1964) (also in The collected works of Richard B\u00fcchi, J., Mac Lane, S., Siefkes, D. (eds.) pp. 317\u2013337. Springer, New York (1990))","DOI":"10.1007\/978-1-4613-8928-6_19"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. In: Arnold, A. (ed.) CAAP 1990. LNCS, vol.\u00a0431, pp. 61\u201386. Springer, Heidelberg (1990) (a full version is in Theoretical Computer Science\u00a0106, 61\u201386 (1992))","DOI":"10.1016\/0304-3975(92)90278-N"},{"key":"12_CR4","unstructured":"Caucal, D.: Bisimulation of context-free grammars and of pushdown automata. In: CSLI, Stanford, vol.\u00a053, pp. 85\u2013106 (1995)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 193\u2013242. Elsevier, Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. Muller","year":"1985","unstructured":"Muller, D., Schupp, P.: The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science\u00a037, 51\u201375 (1985)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:15:45Z","timestamp":1619493345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11779148_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}