{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:28:21Z","timestamp":1649078901059},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90183-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"441-448","source":"Crossref","is-referenced-by-count":0,"title":["A note on the complexity of deciding bisimilarity of normed unary processes"],"prefix":"10.1016","volume":"131","author":[{"given":"Dung T.","family":"Huynh","sequence":"first","affiliation":[]},{"given":"Lu","family":"Tian","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90183-X_BIB1","first-page":"288","article-title":"Parallel complexity in the design and analysis of concurrent systems","volume":"Vol. 505","author":"Alvarez","year":"1991"},{"issue":"3","key":"10.1016\/0304-3975(94)90183-X_BIB2","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","article-title":"Decidability of bisimulation equivalence for processes generating context-free languages","volume":"40","author":"Baeten","year":"1993","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0304-3975(94)90183-X_BIB3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","article-title":"Graphes canoniques de graphes alg\u00e9briques","volume":"24","author":"Caucal","year":"1990","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/0304-3975(94)90183-X_BIB4","first-page":"156","article-title":"Decidability Issues for Infinite-State Processes\u2014A Survey","volume":"51","author":"Christensen","year":"1993","journal-title":"EATCS Bull."},{"key":"10.1016\/0304-3975(94)90183-X_BIB5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)90183-X_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)90183-X_BIB7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","article-title":"A short proof of the decidability of bisimulation for normed BPA-processes","volume":"42","author":"Groote","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90183-X_BIB8","series-title":"Tech. Report CS-R9137","article-title":"Undecidable equivalences for basic process algebra","author":"Groote","year":"1991"},{"key":"10.1016\/0304-3975(94)90183-X_BIB9","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(94)90183-X_BIB10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(84)90092-6","article-title":"Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is \u03a3p2-complete","volume":"33","author":"Huynh","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90183-X_BIB11","first-page":"376","article-title":"Actions speak louder than words: proving bisimilarity for context-free processes","author":"H\u00fcttel","year":"1991","journal-title":"Proc. 6th Annual Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)90183-X_BIB12","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/SPDP.1991.218189","article-title":"Complexity of deciding readiness and failure equivalences for processes","author":"Huynh","year":"1991","journal-title":"Proc. 3rd IEEE Symp. on Parallel and Distributed Processing"},{"key":"10.1016\/0304-3975(94)90183-X_BIB13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(92)00078-6","article-title":"Deciding bisimilarity of normed context-free processes is in \u03a3p2","volume":"123","author":"Huynh","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90183-X_BIB14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite state processes and three problems of equivalence","volume":"86","author":"Kanellakis","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)90183-X_BIB15","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(94)90183-X_BIB16","first-page":"168","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490183X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490183X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:28:23Z","timestamp":1555115303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759490183X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["030439759490183X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90183-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}