enhancing simulation for checking language containment

	enhancing simulation for checking language containment
	Yi Jin; Zhang Wenhui
	2007
会议名称	4th International Conference on Theory and Applications of Models of Computation
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	374-385
会议日期	MAY 22-25,
会议地点	Shanghai, PEOPLES R CHINA
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	Theory and Applications of Models of Computation, Proceedings
ISSN	0302-9743
ISBN	978-3-540-72503-9
部门归属	Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China.
摘要	Many verification approaches based on automata theory are related to the language containment problem, which is PSPACE-complete for nondeterministic automata. To avoid such a complexity, one may use simulation as an approximation to language c
关键词	Approximation Theory Computational Complexity Computer Simulation Polynomials Problem Solving Verification
主办者	Fudan Univ, Software Sch, Univ Leeds, Univ Wisconsin
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/11094
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Yi Jin,Zhang Wenhui. enhancing simulation for checking language containment[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:Theory and Applications of Models of Computation, Proceedings,2007:374-385.