Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revisionBoth sides next revision
tasimsub [2011/11/02 15:24] – [Publications] ondratasimsub [2016/03/04 15:43] rmayr
Line 1: Line 1:
 ====== Publications ====== ====== 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.
   * 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.   * 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.   * 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.
Line 8: Line 9:
  
 [[http://www.fit.vutbr.cz/research/groups/verifit/tools/libvata/|libvata]]: a highly optimised non-deterministic finite tree automata library [[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 ====== ====== People ======
tasimsub.txt · Last modified: by 127.0.0.1