Efficient reduction of nondeterministic automata with application to language inclusion testing

@article{Clemente2017EfficientRO,
  title={Efficient reduction of nondeterministic automata with application to language inclusion testing},
  author={Lorenzo Clemente and Richard Mayr},
  journal={CoRR},
  year={2017},
  volume={abs/1711.09946}
}
We present efficient algorithms to reduce the size of nondeterministic Büchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalence, and inclusion for much larger instances than was previously possible (≥ 1000 states instead of 10-100). This can be used to scale up applications of automata in formal verification tools and decision… CONTINUE READING