Antichains: A New Algorithm for Checking Universality of Finite Automata

This publication has 8 references indexed in Scilit:

• A Lattice Theory for Solving Games of Imperfect Information
  Lecture Notes in Computer Science, 2006
• Experimental Evaluation of Classical Automata Constructions
  Lecture Notes in Computer Science, 2005
• Weak alternating automata are not that weak
  ACM Transactions on Computational Logic, 2001
• Introduction to automata theory, languages, and computation, 2nd edition
  ACM SIGACT News, 2001
• NuSMV: A New Symbolic Model Verifier
  1999
• The complexity of two-player games of incomplete information
  Journal of Computer and System Sciences, 1984
• Alternation
  Journal of the ACM, 1981
• On equations for regular languages, finite automata, and sequential networks
  Theoretical Computer Science, 1980