Implementation and Application of Automata

21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings

  • Yo-Sub Han
  • Kai Salomaa

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9705)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9705)

Table of contents

  1. Front Matter
    Pages I-XVI
  2. Invited Paper

    1. Front Matter
      Pages 1-1
  3. Regular Papers

    1. Front Matter
      Pages 13-13
    2. Holger Bock Axelsen, Markus Holzer, Martin Kutrib
      Pages 15-26
    3. Suna Bensch, Johanna Björklund, Martin Kutrib
      Pages 27-38
    4. Jorge Calvo-Zaragoza, Colin de la Higuera, Jose Oncina
      Pages 39-50
    5. Antonio Di Stasio, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi
      Pages 64-76
    6. Zoltán Ésik
      Pages 77-88
    7. Henning Fernau, Andreas Krebs
      Pages 89-100
    8. Michal Hospodár, Galina Jirásková, Peter Mlynárčik
      Pages 125-137
    9. Jozef Jirásek Jr., Juraj Šebej
      Pages 150-162
    10. Christos A. Kapoutsis, Lamana Mulaffer
      Pages 163-175
    11. Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuła
      Pages 176-188
    12. Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
      Pages 189-201

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 21st International
Conference on Implementation and Application of Automata, CIAA 2016,
held in Seoul, South Korea, in July 2016.

The 26 revised full papers presented were carefully reviewed and selected from
49 submissions. The papers cover a wide range of topics including characterizations of automata, computing distances between strings and languages, implementations of
automata and experiments, enhanced regular expressions, and complexity analysis. 

Keywords

complexity analysis formal languages and automata theory regular languages transducers tree languages automata over infinite objects characterization of automata descriptional complexity DNA computing enhanced regular expressions finite-state automata grammars and context-frree languages hypergraphs imlementations of automata and experiments nondeterminism program generation regular expressions symbolic computation two-dimensional pattern matching universality problem

Editors and affiliations

  • Yo-Sub Han
    • 1
  • Kai Salomaa
    • 2
  1. 1.Yonsei UniversitySeoulKorea (Republic of)
  2. 2.Queen's University KingstonCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-40946-7
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-40945-0
  • Online ISBN 978-3-319-40946-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book