decidability of weak bisimilarity for a subset of bpa

ISCAS OpenIR

	decidability of weak bisimilarity for a subset of bpa
	Chen Haiyan
	2008
发表期刊	Electronic Notes in Theoretical Computer Science
ISSN	15710661
卷号	212 期号:C 页码:241-255
收录类别	ei,acm,sciencedirect
关键词	Approximation Theory Computer Simulation Trees (Mathematics) Verification
部门归属	(1) State Key Laboratory Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, 100080 Beijing, China
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/10299
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Chen Haiyan. decidability of weak bisimilarity for a subset of bpa[J]. Electronic Notes in Theoretical Computer Science,2008,212(C):241-255.
APA	Chen Haiyan.(2008).decidability of weak bisimilarity for a subset of bpa.Electronic Notes in Theoretical Computer Science,212(C),241-255.
MLA	Chen Haiyan."decidability of weak bisimilarity for a subset of bpa".Electronic Notes in Theoretical Computer Science 212.C(2008):241-255.