{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:21:39Z","timestamp":1751660499286},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430025"},{"type":"electronic","value":"9783540452942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_4","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T22:45:12Z","timestamp":1181601912000},"page":"42-56","source":"Crossref","is-referenced-by-count":5,"title":["An Introduction to Decidability of DPDA Equivalence"],"prefix":"10.1007","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Burkart, O., Caucal, D., Moller, F., and Steffen, B. (2001). Verification on infinite structures. In Handbook of Process Algebra, edited Bergstra, J., Ponse, A., and Smolka, S. 545\u2013623, North Holland.","DOI":"10.1016\/B978-044482830-9\/50027-8"},{"key":"4_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"Bisimulation equivalence is decidable for all basic parallel processes","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y. and Moller, F. (1993). Bisimulation equivalence is decidable for all basic parallel processes. Lecture Notes in Computer Science, 715, 143\u2013157."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"Christensen, S., H\u00fcttel, H., and Stirling, C. (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121, 143\u2013148.","journal-title":"Information and Computation"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ginsberg, S., and Greibach, S. (1966). Deterministic context-free languages. Information and Control, 620\u2013648.","DOI":"10.1016\/S0019-9958(66)80019-0"},{"key":"4_CR5","unstructured":"Harrison, M. (1978). Introduction to Formal Language Theory, Addison-Wesley."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","volume":"7","author":"M. Harrison","year":"1973","unstructured":"Harrison, M., and Havel, I. (1973). Strict deterministic grammars. Journal of Computer and System Sciences, 7, 237\u2013277.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(79)90024-0","volume":"9","author":"M. Harrison","year":"1979","unstructured":"Harrison, M., Havel, I., and Yehudai, A. (1979). On equivalence of grammars through transformation trees. Theoretical Computer Science, 9, 173\u2013205.","journal-title":"Theoretical Computer Science"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, H., and Stirling, C. (1991). Actions speak louder than words: proving bisimilarity for context free processes. Proceedings 6th Annual Symposium on Logic in Computer Science, IEEE Computer Science Press, 376\u2013386.","DOI":"10.1109\/LICS.1991.151661"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Korenjak, A and Hopcroft, J. (1966). Simple deterministic languages. Procs. 7th Annual IEEE Symposium on Switching and Automata Theory, 36\u201346.","DOI":"10.1109\/SWAT.1966.22"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/S0019-9958(80)90887-6","volume":"45","author":"M. Oyamaguchi","year":"1980","unstructured":"Oyamaguchi, M., Honda, N., and Inagaki, Y. (1980). The equivalence problem for real-time strict deterministic languages. Information and Control, 45, 90\u2013115.","journal-title":"Information and Control"},{"key":"4_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/3-540-63165-8_221","volume-title":"The equivalence problem for deterministic pushdown automata is decidable","author":"G. S\u00e9nizergues","year":"1997","unstructured":"S\u00e9nizergues, G. (1997). The equivalence problem for deterministic pushdown automata is decidable. Lecture Notes in Computer Science, 1256, 671\u2013681."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00285-1","volume":"251","author":"G. S\u00e9nizergues","year":"2001","unstructured":"S\u00e9nizergues, G. (2001). L(A) = L(B)? decidability results from complete formal systems. Theoretical Computer Science, 251, 1\u2013166.","journal-title":"Theoretical Computer Science"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0304-3975(97)00216-8","volume":"195","author":"C. Stirling","year":"1998","unstructured":"Stirling, C. (1998). Decidability of bisimulation equivalence for normed pushdown processes. Theoretical Computer Science, 195, 113\u2013131.","journal-title":"Theoretical Computer Science"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00389-3","volume":"255","author":"C. Stirling","year":"2001","unstructured":"Stirling, C. (2001). Decidability of DPDA equivalence. Theoretical Computer Science, 255, 1\u201331.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T21:27:47Z","timestamp":1556486867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}