Posters
| Paper title |
Author(s) |
| Reachability Analysis of Procedural Programs with Affine Integer Arithmetic (abstract) |
Michael Luttenberger |
| Lexical Disambiguation with Polarities and Automata (abstract) |
Guillaume Bonfante, Joseph Le Roux, Guy Perrier |
| A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems (abstract) |
Suman Roy, Bhaskar Chakraborty |
| Parsing Computer Languages with an Automaton Compiled From a Single Regular Expression (abstract) |
Adrian Thurston |
| Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits (abstract) |
Guowu Yang, Fei Xie, Xiaoyu Song, Marek Perkowski |
| Tighter Packed Bit-Parallel NFA for Approximate String Matching (abstract) |
Heikki Hyyrö |
| XSLT Version 2.0 is Turing-Complete: A Purely Transformation Based Proof (abstract) |
Ruhsan Onder, Zeki Bayram |
