Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar. Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. In Oscar H. Ibarra, Bala Ravikumar, editors, Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings. Volume 5148 of Lecture Notes in Computer Science, pages 57-67, Springer, 2008. [doi]

@inproceedings{BouajjaniHHTV08,
  title = {Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata},
  author = {Ahmed Bouajjani and Peter Habermehl and Lukás Holík and Tayssir Touili and Tomás Vojnar},
  year = {2008},
  doi = {10.1007/978-3-540-70844-5_7},
  url = {http://dx.doi.org/10.1007/978-3-540-70844-5_7},
  tags = {rule-based, testing},
  researchr = {https://researchr.org/publication/BouajjaniHHTV08},
  cites = {0},
  citedby = {0},
  pages = {57-67},
  booktitle = {Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings},
  editor = {Oscar H. Ibarra and Bala Ravikumar},
  volume = {5148},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-70843-8},
}