====== Publications ======

  * Ricardo Almeida, Lukas Holik, Richard Mayr. [[http://arxiv.org/abs/1512.08823 | Reduction of Nondeterministic Tree Automata]]. TACAS 2016, LNCS 9636. Eindhoven, The Netherlands. 2016.
  * Ricardo Almeida. [[https://arxiv.org/abs/1612.04981 | Reducing Nondeterministic Tree Automata by Adding Transitions]]. MEMICS 2016. Electronic Proceedings in Theoretical Computer Science. Volume 233. DOI 10.4204/EPTCS.233.4.
  * Ricardo Almeida. [[http://hdl.handle.net/1842/28794 | Efficient algorithms for hard problems in nondeterministic tree automata]]. PhD thesis. School of Informatics. University of Edinburgh, UK. 2017.
  * A. Bouajjani, P. Habermehl, L. Holik, T. Touili, and T. Vojnar. [[http://www.springerlink.com/content/th5316x6746g8253/|Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata]]. In Proc. of 13th International Conference on Implementation and Application of Automata---CIAA'08, San Francisco, CA, USA, volume 5148 of LNCS, pages 57--67, 2008. Springer-Verlag. An extended version appeared as the [[http://www.fit.vutbr.cz/~vojnar/Publications/bhhtv-nartmc-tr-08.pdf|technical report FIT-TR-2008-001]], FIT BUT, Brno, Czech Republic, 2008.
  * P.A. Abdulla, Y.-F. Chen, L. Holik, R. Mayr, and T. Vojnar. [[http://www.springerlink.com/content/a2g32650q853l185/?p=5a3f698fe2924e98ba116c85fbd7d1d8&pi=13|When Simulation Meets Antichains (On Checking Language Inclusion of NFAs)]]. In Proc. of 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems---TACAS'10, Paphos, Cyprus, volume 6015 of LNCS (the ARCoSS subline), pages 158--174, 2010. Springer-Verlag. An extended version appeared as the [[http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2010-001.pdf|technical report FIT-TR-2010-01]], FIT BUT, Brno, Czech Republic, 2010.
  * L. Holik, O. Lengal, J. Simacek, and T. Vojnar. [[http://www.springerlink.com/content/7058528622w84551/|Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata]]. In Proc. of 9th International Symposium on Automated Technology for Verification and Analysis---ATVA'11, Taipei, Taiwan, volume 6996 of LNCS, pages 243--258, 2011. An extended version appeared as the [[http://www.fit.vutbr.cz/~ilengal/pub/FIT-TR-2011-04.pdf|technical report FIT-TR-2011-04]], FIT BUT, Brno, Czech Republic, 2011. 

====== Tool Support ======

[[http://www.fit.vutbr.cz/research/groups/verifit/tools/libvata/|libvata]]: a highly optimised non-deterministic finite tree automata library

[[https://github.com/ric-almeida/heavy-minotaut|heavy-minotaut]]: an additional libvata module
for reducing the size of nondeterministic tree automata.

====== People ======

{{:parosh-abdulla.jpg?nolink|Parosh Aziz Abdulla}}{{:lukas-holik.jpg?nolink|Lukas Holik}}{{:ondrej-lengal.jpg?nolink|Ondra Lengal}}{{:jiri-simacek.jpg?nolink|Jiri Simacek}}{{:tomas-vojnar.jpg?nolink|Tomas Vojnar}}



====== Related Resources ======

  * [[http://mtc.epfl.ch/~doyen/antichains/antichains.html|Antichains for Verification]]