Accepted papers

  1. Ugo de'Liguoro. The Approximation Theorem for the Lambda-mu Calculus (extended abstract).
  2. Violetta Lonati, Dino Mandrioli, Federica Panella and Matteo Pradella. Free Grammars and Languages.
  3. Mohammed Abu Ayyash and Emanuele Rodaro. A language theoretical approach to some problems on inverse semigroups.
  4. Andrea Frosini, Simone Rinaldi, Daniela Battaglino, Laurent Vuillon, Samanta Socci and Mathilde Bouvel. Pattern-avoiding polyominoes.
  5. Emanuele Rodaro and Rogério Reis. Reset Regular Decomposition Complexity of Regular Ideal Languages.
  6. Maurice H. Ter Beek, Fabio Gadducci and Francesco Santini. Validating Reconfigurations of Reo Circuits.
  7. Luca Aceto, Dario Della Monica, Anna Ingolfsdottir, Angelo Montanari and Guido Sciavicco. A complete classification of the expressiveness of interval logics of Allen's relations over dense linear orders.
  8. Antonio Bernini, Stefano Bilotta, Renzo Pinzani and Vincent Vajnovszki. Two Gray Codes for q-ary k-generalized Fibonacci Strings.
  9. Stefano Crespi Reghizzi and Pierluigi San Pietro. Commutative consensual counter languages.
  10. Maurice H. Ter Beek, Alberto Lluch Lafuente and Marinella Petrocchi. Combining Declarative and Procedural Views in the Specification and Analysis of Product Families.
  11. Marina Lenisa, Furio Honsell and Rekha Redamalla. Polarized Multigames.
  12. Ilario Bonacina and Nicola Galesi. Space Complexity in Algebraic Proof Systems.
  13. Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni, Riccardo Dondi and Yuri Pirola. Covering Pairs in Directed Acyclic Graphs.
  14. Pietro Cenciarelli, Daniele Gorla and Ivano Salvo. Braess's Paradox and Minimal Flows.
  15. Julien Clément and Laura Giambruno. On the complexity of strings.
  16. Eugenio Omodeo, Alberto Policriti and Alexandru I. Tomescu. Bridging syllogistics with combinatorics.
  17. Luca Bernardinello, Carlo Ferigato, Stefan Haar and Lucia Pomello. Dynamically Closed Sets in Occurrence Nets.
  18. Stefano Bistarelli, Simon Foley, Francesco Santini and Francesco Vicino. An Introduction to Consistently Merging Trust-Networks with Bipolar Preferences.
  19. Vladimir Gusev, Marina Maslennikova, Elena Pribavkina and Emanuele Rodaro. Language theoretic approach to synchronizing automata.
  20. Marcella Anselmo, Dora Giammarresi and Maria Madonia. Strong prefix codes of pictures.
  21. Massimo Bartoletti, Paolo Di Giamberardino and Roberto Zunino. Towards a linear contract logic.
  22. Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi and Walter Quattrociocchi. Minimum Weight Multicolor Dynamos.
  23. Luca Bernardinello and Carlo Ferigato. On the composition of regional structures and their logics (extended abstract).
  24. Raffaella Gentilini. A SAT Encoding for Solving Games with Energy Objectives.
  25. Emanuele Rodaro and Rogério Reis. The Language of Initially Connected Deterministic Finite Automata.
  26. Filippo Mignosi, Alessio Langiu, Maxime Crochemore and Costas Iliopoulos. On the Multiple Common Substring Problem.
  27. Davide Ancona, Paola Giannini and Elena Zucca. Incremental Rebinding.
  28. Carl Barton, Costas Iliopoulos and Solon Pissis. Circular String Matching Revisited.
  29. Marcello M. Bersani, Matteo Rossi and Pierluigi San Pietro. Deciding in practice the Satisfiability of Continuous-time Metric Temporal Logic.
  30. Alessio Langiu, Ali Alatabbi, M. Sohel Rahman and Costas S. Iliopoulos. Computing the Longest Common Abelian Factor.