Skip to main content
SpringerLink
Log in

Implementation and Applications of Automata

13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Oscar H. Ibarra
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bala Ravikumar
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: CIAA 2008.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  3. Technical Contributions

    1. Automated Compositional Reasoning of Intuitionistically Closed Regular Properties

      • Yih-Kuen Tsay, Bow-Yaw Wang
      Pages 36-45

    2. Antimirov and Mosses’s Rewrite System Revisited

      • Marco Almeida, Nelma Moreira, Rogério Reis
      Pages 46-56

    3. Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

      • Ahmed Bouajjani, Peter Habermehl, Lukáš Holík, Tayssir Touili, Tomáš Vojnar
      Pages 57-67

    4. Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)

      • J. -M. Champarnaud, J. -Ph. Dubernard, H. Jeanne
      Pages 68-77

    5. Hopcroft’s Minimization Technique: Queues or Stacks?

      • Andrei Păun, Mihaela Păun, Alfonso Rodríguez-Patón
      Pages 78-91

    6. Learning Regular Languages Using Nondeterministic Finite Automata

      • Pedro García, Manuel Vázquez de Parga, Gloria I. Álvarez, José Ruiz
      Pages 92-101

    7. Multi-Return Macro Tree Transducers

      • Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth
      Pages 102-111

    8. Computing Convex Hulls by Automata Iteration

      • François Cantin, Axel Legay, Pierre Wolper
      Pages 112-121

    9. A Translation from the HTML DTD into a Regular Hedge Grammar

      • Takuya Nishiyama, Yasuhiko Minamide
      Pages 122-131

    10. Tree-Series-to-Tree-Series Transformations

      • Andreas Maletti
      Pages 132-140

    11. Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning

      • Ryan Dixon, Ömer Eğecioğlu, Timothy Sherwood
      Pages 141-150

    12. Pattern Matching in DCA Coded Text

      • Jan Lahoda, Bořivoj Melichar, Jan Žd’árek
      Pages 151-160

    13. Five Determinisation Algorithms

      • Rob van Glabbeek, Bas Ploeger
      Pages 161-170

    14. Persistent Computations of Turing Machines

      • Harald Hempel, Madlen Kimmritz
      Pages 171-180

    15. On Complexity of Two Dimensional Languages Generated by Transducers

      • Egor Dolzhenko, Nataša Jonoska
      Pages 181-190
Back to top

Other volumes

  1. Implementation and Applications of Automata

Keywords

About this book

The 13th International Conference on Implementation and Application of - tomata (CIAA 2008) was held at San Francisco State University, San Francisco, July 21–24, 2008. This volume of Lecture Notes in Computer Science contains the papers that were presented at CIAA 2008, as well as the abstracts of the poster papers that were displayed during the conference. The volume also includes the - per/extended abstract of the four invited talks presented by Markus Holzer, Kai Salomaa, Mihalis Yannakakis, and Hsu-Chun Yen. The 24 regular papers were selected from 40 submissions covering various topics in the theory, implementation, and applications of automata and related structures. Each submitted paper was reviewed by at least three ProgramC- mittee members, with the assistance of external referees. The authors of the papers and posters presented in this volume come from the following co- tries: Australia, Belgium, Canada, China, Columbia, Czech Republic, France, Germany, Hungary, Italy, Japan, The Netherlands, Poland, Portugal, Romania, Russia, Spain, Sweden, Taiwan, United Arab Emerates, and USA. We wish to thank all who made this conference possible: the authors for s- mittingpapers,theProgramCommitteemembersandexternalreferees(listedin the proceedings) for their excellent work, and the four invited speakers. Finally, we wish to express our sincere appreciation to the sponsors, local organizers, and the editors of the Lecture Notes in Computer Science seriesand Springer, in particular Alfred Hofmann, for their help in publishing this volume in a timely manner.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation