Helmut Lescow

Suggest Changes
Learn More
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a(More)
  • 1