A Comparative Study of Algorithms for Büchi Complementation
碩士 === 國立臺灣大學 === 資訊管理學研究所 === 96 === Büchi Complementation is a fundamental problem in the automata-theoretic approach to model checking. The theoretically optimal upper bound is 2O(n log n) which is provided by M. Michel in 1988. The precise bound of Büchi complementation is ((0.36n)n). Then the t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42181931272759046300 |