Skip to main content
Springer Nature Link
Log in

Implementation and Application of Automata

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Michael Domaratzki

    1. Department of Computer Science, University of Manitoba, Winnipeg, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kai Salomaa

    1. School of Computing, Queen’s University, Kingston, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • unique visibility, state-of-the-art survey,
  • fast-track conference proceedings

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CIAA 2010.

  • 20k Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (34 papers)

  1. Front Matter

    Download chapter 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
Back to top

Other volumes

  1. Implementation and Application of Automata

Editors and Affiliations

  • Department of Computer Science, University of Manitoba, Winnipeg, Canada

    Michael Domaratzki

  • School of Computing, Queen’s University, Kingston, Canada

    Kai Salomaa

Bibliographic Information

Publish with us

Policies and ethics

Back to top