AI helps you reading Science
When simulation meets antichains: on checking language inclusion of nondeterministic finite (tree) automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Constructi..., (2010): 158-174
EI
Keywords
Abstract
We describe a new and more efficient algorithm for checking universality and language inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the best of our knowledge, the antichain-based approach proposed by De Wulf et al. was the most efficient one so far. Our idea is to exploit a simulation relation on the ...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn