Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
pubs [2016/03/04 23:40] rmayr |
pubs [2018/03/14 03:04] (current) rmayr |
||
|---|---|---|---|
| Line 15: | Line 15: | ||
| ===Automata Minimization=== | ===Automata Minimization=== | ||
| * 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, 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. | ||
| * Richard Mayr, Lorenzo Clemente. [[http://www.inf.ed.ac.uk/publications/report/1414.html | Advanced Automata Minimization.]] POPL 2013. ACM 2013. Extended Technical Report EDI-INF-RR-1414. | * Richard Mayr, Lorenzo Clemente. [[http://www.inf.ed.ac.uk/publications/report/1414.html | Advanced Automata Minimization.]] POPL 2013. ACM 2013. Extended Technical Report EDI-INF-RR-1414. | ||
| * Lorenzo Clemente [[http://arxiv.org/abs/1102.3285 | Buechi Automata Can Have Smaller Quotients.]] ICALP 2011: 258-270. | * Lorenzo Clemente [[http://arxiv.org/abs/1102.3285 | Buechi Automata Can Have Smaller Quotients.]] ICALP 2011: 258-270. | ||