Advertisement

Implementation and Application of Automata

15th International Conference, CIAA 2010, Winnipeg, MB, Canada, August 12-15, 2010. Revised Selected Papers

  • Michael Domaratzki
  • Kai Salomaa
Conference proceedings CIAA 2010

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

Table of contents

  1. Front Matter
    PDF
  2. Using Automata to Describe Self-Assembled Nanostructures
    Nataša Jonoska
    Pages 1-3
  3. A Summary of Some Discrete-Event System Control Problems
    Karen Rudie
    Pages 4-16
  4. Large-Scale Training of SVMs with Automata Kernels
    Cyril Allauzen, Corinna Cortes, Mehryar Mohri
    Pages 17-27
  5. Filters for Efficient Composition of Weighted Finite-State Transducers
    Cyril Allauzen, Michael Riley, Johan Schalkwyk
    Pages 28-38
  6. Incremental DFA Minimisation
    Marco Almeida, Nelma Moreira, Rogério Reis
    Pages 39-48
  7. Finite Automata for Generalized Approach to Backward Pattern Matching
    Jan Antoš, Bořivoj Melichar
    Pages 49-58
  8. Partial Derivative Automata Formalized in Coq
    José Bacelar Almeida, Nelma Moreira, David Pereira, Simão Melo de Sousa
    Pages 59-68
  9. Regular Geometrical Languages and Tiling the Plane
    Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
    Pages 69-78
  10. COMPAS - A Computing Package for Synchronization
    Krzysztof Chmiel, Adam Roman
    Pages 79-86
  11. From Sequential Extended Regular Expressions to NFA with Symbolic Labels
    Alessandro Cimatti, Sergio Mover, Marco Roveri, Stefano Tonetta
    Pages 87-94
  12. State Complexity of Catenation Combined with Union and Intersection
    Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
    Pages 95-104
  13. Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
    Volker Diekert, Steffen Kopecki
    Pages 105-114
  14. On Straight Words and Minimal Permutators in Finite Transformation Semigroups
    Attila Egri-Nagy, Chrystopher L. Nehaniv
    Pages 115-124
  15. On Lazy Representations and Sturmian Graphs
    Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit
    Pages 125-134
  16. Symbolic Dynamics, Flower Automata and Infinite Traces
    Wit Foryś, Piotr Oprocha, Slawomir Bakalarski
    Pages 135-142
  17. The Cayley-Hamilton Theorem for Noncommutative Semirings
    Radu Grosu
    Pages 143-153
  18. Approximating Minimum Reset Sequences
    Michael Gerbush, Brent Heeringa
    Pages 154-162
  19. Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata
    Norbert Hundeshagen, Friedrich Otto, Marcel Vollweiler
    Pages 163-172
  20. Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization
    J. Howard Johnson
    Pages 173-180
  21. Partially Ordered Two-Way Büchi Automata
    Manfred Kufleitner, Alexander Lauser
    Pages 181-190
  22. Two-Party Watson-Crick Computations
    Martin Kutrib, Andreas Malcher
    Pages 191-200
  23. Better Hyper-minimization
    Andreas Maletti
    Pages 201-210
  24. Regular Expressions on Average and in the Long Run
    Manfred Droste, Ingmar Meinecke
    Pages 211-221
  25. Reachability Games on Automatic Graphs
    Daniel Neider
    Pages 222-230
  26. Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
    Satoshi Okui, Taro Suzuki
    Pages 231-240
  27. A Polynomial Time Match Test for Large Classes of Extended Regular Expressions
    Daniel Reidenbach, Markus L. Schmid
    Pages 241-250
  28. A Challenging Family of Automata for Classical Minimization Algorithms
    Giusi Castiglione, Cyril Nicaud, Marinella Sciortino
    Pages 251-260
  29. State of Büchi Complementation
    Ming-Hsien Tsai, Seth Fogarty, Moshe Y. Vardi, Yih-Kuen Tsay
    Pages 261-271
  30. Types of Trusted Information That Make DFA Identification with Correction Queries Feasible
    Cristina Tîrnăucă, Cătălin Ionuţ Tîrnăucă
    Pages 272-281
  31. Compressing Regular Expressions’ DFA Table by Matrix Decomposition
    Yanbing Liu, Li Guo, Ping Liu, Jianlong Tan
    Pages 282-289
  32. Relational String Verification Using Multi-track Automata
    Fang Yu, Tevfik Bultan, Oscar H. Ibarra
    Pages 290-299
  33. A Note on a Tree-Based 2D Indexing
    Jan Žd’árek, Bořivoj Melichar
    Pages 300-309
  34. Regular Expressions at Their Best: A Case for Rational Design
    Vincent Le Maout
    Pages 310-320
  35. Simulations of Weighted Tree Automata
    Zoltán Ésik, Andreas Maletti
    Pages 321-330
  36. Back Matter
    PDF

About these proceedings

Introduction

This book constitutes the thoroughly refereed papers of the 15th International Conference on Implementation and Application of Automata, CIAA 2010, held in Manitoba, Winnipeg, Canada, in August 2010.

The 26 revised full papers together with 6 short papers were carefully selected from 52 submissions. The papers cover various topics such as applications of automata in computer-aided verification; natural language processing; pattern matching, data storage and retrieval; bioinformatics; algebra; graph theory; and foundational work on automata theory.

Keywords

algebra automata kernels complexity finite automata finite-state machines formal languages games graph theory nanostructures regular expressions self-assembly tiling tree automata

Editors and affiliations

  • Michael Domaratzki
    • 1
  • Kai Salomaa
    • 2
  1. 1.Department of Computer ScienceUniversity of ManitobaWinnipegCanada
  2. 2.School of ComputingQueen’s UniversityKingstonCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-18098-9
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-18097-2
  • Online ISBN 978-3-642-18098-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site