Lower bounds for complementation of ω-automata via the full automata technique

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4052 LNCS, Issue , 2006, Pages 589-600

  Yan, Qiqi ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; COMPUTER SCIENCE; MATHEMATICAL TRANSFORMATIONS;

AUTOMATA TECHNIQUE; LOWER BOUND ANALYSIS;

AUTOMATA THEORY;

EID: 33746365877     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_50     Document Type: Conference Paper

References (21)

1. [Bir93] J.C. Birget. Partial orders on words, minimal elements of regular languages and state complexity (has online erratum). Theor. Corn-put. Sci, 119(2): 267-291, 1993.
2. [Büc62] J. R. Büchi. On a decision method in restricted second order arithmetic. In Proceedings of the International Congress on Logic, Method, and Philosophy of Science, pages 1-12. Stanford University Press, 1962.
3. [FKV04] E. Friedgut, O. Kupferman, and M.Y. Vardi. Büchi complementation made tighter. In ATVA, volume 3299 of LNCS, pages 64-78, 2004. refer to http://www.cs.rice.edu/vardi/papers/index.html.
4. [HK02] M. Holzer and M. Kutrib. State complexity of basic operations on nondeterministic finite automata. In 7th CIAA, volume 2608 of LNCS, pages 148-157, 2002.
5. [Jir05] G. Jirásková. State complexity of some operations on binary regular languages. Theor. Comput. Sci, 330(2):287-298, 2005.
6. [Kla91] N. Klarlund. Progress measures for complementation of omega-automata with applications to temporal logic. In 32th FOCS, pages 358-367, 1991.
7. [Kur94] R.P. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton Univ. Press, 1994.
8. [KV01] O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM Transactions on Computational Logic, 2 (3):408-429, 2001.
9. [KV05a] O. Kupferman and M.Y. Vardi. Complementation constructions for nondeterministic automata on infinite words. In TAC AS, pages 206-221, 2005.
10. [KV05b] O. Kupferman and M.Y. Vardi. From complementation to certification. Theor. Comput. Sci, 345(1):83-100, 2005.
11. [Löd99] C. Löding. Optimal bounds for transformations of omega-automata. In 19th FSTTCS, volume 1738 of LNCS, pages 97-109, 1999.
12. [Mic88] M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
13. [RS59] M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114-125, 1959.
14. [Saf88] S. Safra. On the complexity of ω-automata. In 29th FOCS, pages 319-327, 1988.
15. [Saf89] S. Safra. Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science, 1989.
16. [SS78] W.J. Sakoda and M. Sipser. Nondeterminism and the size of two way finite automata. In 10th STOC, pages 275-286, 1978.
17. [SVW85] A.P. Sistla, M.Y. Vardi, and Pierre Wolper. The complementation problem for Büchi automata with applications to temporal logic (extended abstract). In 12th ICALP, volume 194 of LNCS, pages 465-474, 1985.
18. [Tho97] W. Thomas. Languages, automata and logic. In Handbook of Formal Languages, volume 3, pages 389-455. Springer-Verlag, Berlin, 1997.
19. [Var05] M.Y. Vardi. Büchi complementation: A 40-year saga. In The 9th Asian Logic Conference, 2005.
20. [VW94] M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Inf. Comput., 115(1): 1-37, 1994.
21. [Yu04] S. Yu. State complexity: Recent results and open problems, 2004. Invited talk at ICALP'04 Workshop in Formal Languages (slides online).