Accepted Papers

(alphabetically ordered by author names)

1)Parosh Aziz Abdulla, Mohamed Faouzi Atig and Jari Stenman. Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata
2)Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet and Ronnie Barequet. Formulae for polyominoes on twisted cylinders
3)Marcella Anselmo, Dora Giammarresi and Maria Madonia. Pictures Codes with Finite Deciphering Delay
4)Fernando Arroyo, Sandra Gomez Canaval, Victor Mitrana and Stefan Popescu. Networks of Polarized Evolutionary Processors Are Computationally Complete
5)Zuzana Bednarova and Viliam Geffert. Two Double-Exponential Gaps for Automata with a Limited Pushdown
6)Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni, Riccardo Dondi and Yuri Pirola. Covering Pairs in Directed Acyclic Graphs
7)Slimane Bellaouar, Hadda Cherroun and Djelloul Ziadi. Efficient List-based Computation of the String Subsequence Kernel
8)Beatrice Berard and Olivier Carton. Channel synthesis revisited
9)Eike Best and Raymond Devillers. Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
10)Francine Blanchet-Sadri, Andrew Lohr, Sean Simmons and Brent Woodhouse. Computing Depths of Patterns
11)Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé, Michaël Larouche and Hugo Tremblay. Solving Equations on Words with Morphisms and Antimorphisms
12)Alexandre Blondin Massé, Amadou Makhtar Tall and Hugo Tremblay. On the Arithmetics of Discrete Figures
13)Joan Boyar, Shahin Kamali, Alejandro Lopez-Ortiz and Kim S. Larsen. On the List Update Problem with Advice
14)Luca Breveglieri, Stefano Crespi Reghizzi and Angelo Morzenti. Shift-Reduce Parsers for Transition Networks
15)Daniel Bundala and Jakub Zavodny. Optimal Sorting Networks
16)Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil and Karin Quaas. Satisfiability for MTL and TPTL over Non-Monotonic Data Words
17)Pascal Caron, Flouret Marianne and Ludovic Mignot. (k,l)-Unambiguity and Quasi-Deterministic Structures: an Alternative for the Determinization
18)Anton Cerny. Solutions to the multi-dimensional equal powers problem constructed by composition of rectangular morphisms
19)Bireswar Das, Patrick Scharpfenecker and Jacobo Torán. Succinct encodings of Graph Isomorphism
20)Alberto Dennunzio, Enrico Formenti and Luca Manzoni. Extremal Combinatorics of Reaction Systems
21)Liang Ding, Abdul Samad, Xingran Xue, Xiuzhen Huang, Russell L. Malmberg and Liming Cai. Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling
22)Etienne Dubourg and David Janin. Algebraic tools for the overlapping tile product
23)Stefan Dück and Manfred Droste. Weighted Automata and Logics for Infinite Nested Words
24)Bertram Felgenhauer and René Thiemann. Reachability Analysis with State-Coherent Automata
25)Bernd Finkbeiner and Hazem Torfah. Counting Models of Linear-time Temporal Logic
26)Enrico Formenti, Markus Holzer, Martin Kutrib and Julien Provillard. ω-rational languages: high complexity classes vs. Borel Hierarchy
27)Pierre Ganty and Ahmed Rezine. Ordered Counter Abstraction (Refinable Subword Relations for Parameterized Verification)
28)Rob Gysel. Potential Maximal Clique Algorithms for Perfect Phylogeny Problems
29)Dariusz Kalociński. On Computability and Learnability of the Pumping Lemma Function
30)Joachim Klein, David Müller, Christel Baier and Sascha Klueppelholz. Are Good-for-Games Automata Good for Probabilistic Model Checking?
31)Sang-Ki Ko, Yo-Sub Han and Kai Salomaa. Top-Down Tree Edit-Distance of Regular Tree Languages
32)Hanna Klaudel, Maciej Koutny and Zhenhua Duan. Interval Temporal Logic Semantics of Box Algebra
33)Oliver Kullmann and Matthew Gwynne. On SAT representations of XOR constraints
34)Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko and Marc Tommasi. Learning Sequential Tree-to-Word Transducers
35)María Martos-Salgado and Fernando Rosa-Velardo. Expressiveness of dynamic networks of Timed Petri Nets
36)Zeinab Mazadi, Ziyuan Gao and Sandra Zilles. Distinguishing Pattern Languages with Membership Examples
37)Friedrich Otto and Frantisek Mraz. Extended Two-way Ordered Restarting Automata
38)Daniel Prusa. Weight-reducing Hennie Machines and Their Descriptional Complexity
39)Hans Simon and Marius Konitzer. DFAs with a Bounded Activity Level
40)Paul Tarau. Computing with Catalan Families
41)Matias Tealdi and Matthias Gallé. On context-diverse repeats and their incremental computation
42)Farouk Toumani, Francois Pinet and Haizhou Li. Probabilistic simulation for probabilistic data-aware business processes
43)Vojtěch Vorel. Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata
44)Thomas Weidner. Probabilistic ω-Regular Expressions
45)Shenggen Zheng, Jozef Gruska and Daowen Qiu. On the State Complexity of Semi-Quantum Finite Automata