Antichains: A new algorithm for checking universality of finite automata

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

Volumn 4144 LNCS, Issue , 2006, Pages 17-30

  De Wulf, M ^a   Doyen, L ^a   Henzinger, T A ^b,c   Raskin, J F ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b EPFL   (Switzerland)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; PROBLEM SOLVING; QUERY LANGUAGES;

ANTICHAIN METHODS; LANGUAGE INCLUSION PROBLEM; MONOTONE FUNCTIONS; UNIVERSALITY;

ALGORITHMS;

EID: 33749821460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_5     Document Type: Conference Paper

References (11)

1. [BL80] J.A. Brzozowski and E.L. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science, 10:19-35, 1980.
2. [CCGR99] A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model verifier. In Computer Aided Verification, LNCS 1633, pages 495-499. Springer, 1999.
3. [CKS81] A.K. Chandra, D. Kozen, and L.J. Stockmeyer. Alternation. J. ACM, 28:114-133, 1981.
4. [DDR06] M. De Wulf, L. Doyen, and J.-F. Raskin. A lattice theory for solving games of imperfect information. In Hybrid Systems-Computation and Control, LNCS 3927, pages 153-168. Springer, 2006.
5. [HMU01] J.E. Hopcroft, R. Motwani, and J.D.'Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001.
6. [KV01] O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM Trans. Computational Logic, 2:408-429, 2001.
7. [M004] A. Møller. dk.brics.automaton, http://www.brics.dk/ automaton, 2004.
8. [MS72] A.R. Meyer and L.J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Symp. Foundations of Computer Science, pages 125-129. IEEE Computer Society, 1972.
9. [Rei84] J.H. Reif. The complexity of two-player games of incomplete information. J. Computer and System Sciences, 29:274-301, 1984.
10. [Som98] F. Somenzi. CUDD: CU Decision Diagram Package Release 2.3.0. University of Colorado at Boulder, 1998.
11. [TV05] D. Tabakov and M.Y. Vardi. Experimental evaluation of classical automata constructions. In Logic for Programming, Artificial Intelligence, and Reasoning, LNCS 3835, pages 396-411. Springer, 2005.