Implementation and Application of Automata

22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings

  • Arnaud Carayol
  • Cyril Nicaud
Conference proceedings CIAA 2017
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10329)

Table of contents

  1. Front Matter
    Pages I-XX
  2. Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Sævar Örn Kjartansson
    Pages 1-13
  3. Martin Berglund, Brink van der Merwe, Bruce Watson, Nicolaas Weideman
    Pages 14-26
  4. Henrik Björklund, Johanna Björklund, Petter Ericson
    Pages 27-39
  5. Janusz A. Brzozowski, Corwin Sinnamon
    Pages 52-63
  6. Claudia Cauli, Nir Piterman
    Pages 64-75
  7. Robert Ferens, Marek Szykuła
    Pages 76-88
  8. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
    Pages 89-100
  9. Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg
    Pages 101-112
  10. Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz
    Pages 113-125
  11. Yo-Sub Han, Sang-Ki Ko
    Pages 126-137
  12. Michal Hospodár, Galina Jirásková, Peter Mlynárčik
    Pages 138-150
  13. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
    Pages 151-162
  14. Louis-Marie Dando, Sylvain Lombardy
    Pages 163-174
  15. Marek Szykuła, John Wittnebel
    Pages 201-212
  16. Back Matter
    Pages 213-213

About these proceedings


This book constitutes the refereed proceedings of the 22nd International Conference on Implementation and Application of Automata, CIAA 2017,held in Marne-la-Vallée, France, in June 2017.

The 17 revised full papers presented were carefully reviewed and selected from 31 submissions. The topics of the presented papers include state complexity of automata; implementations of automata and experiments; enhanced regular expressions; and complexity analysis.


Algebraic language theory Rewrite systems Automata over infinite objects Grammars and context-free languages Tree languages Automata extensions Transducers Quantitative automata Regular languages language finite automata regular expression upper bounds semantics

Editors and affiliations

  • Arnaud Carayol
    • 1
  • Cyril Nicaud
    • 2
  1. 1.LIGM (UMR 8049), CNRSUniversité Paris-EstMarne-la-Vallée Cedex 2France
  2. 2.LIGM (UMR 8049)Université Paris-EstMarne-la-Vallée Cedex 2France

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-60133-5
  • Online ISBN 978-3-319-60134-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book