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.

Keywords

Bibliographic Information

Book Title: Implementation and Applications of Automata
Book Subtitle: 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings
Editors: Oscar H. Ibarra, Bala Ravikumar
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-540-70844-5
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2008
Softcover ISBN: 978-3-540-70843-8Published: 10 July 2008
eBook ISBN: 978-3-540-70844-5Published: 23 July 2008
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 289
Topics: Computation by Abstract Devices, Programming Techniques, Programming Languages, Compilers, Interpreters, Algorithm Analysis and Problem Complexity, Logics and Meanings of Programs, Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Implementation and Applications of Automata

Editors:

Sections

Buy it now

Other ways to access

Table of contents (30 papers)

Front Matter

Invited Lectures

Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity

Language Decompositions, Primality, and Trajectory-Based Operations

Automata, Probability, and Recursion

Concurrency, Synchronization, and Conflicts in Petri Nets

Technical Contributions

Automated Compositional Reasoning of Intuitionistically Closed Regular Properties

Antimirov and Mosses’s Rewrite System Revisited

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

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

Hopcroft’s Minimization Technique: Queues or Stacks?

Learning Regular Languages Using Nondeterministic Finite Automata

Multi-Return Macro Tree Transducers

Computing Convex Hulls by Automata Iteration

A Translation from the HTML DTD into a Regular Hedge Grammar

Tree-Series-to-Tree-Series Transformations

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

Pattern Matching in DCA Coded Text

Five Determinisation Algorithms

Persistent Computations of Turing Machines

On Complexity of Two Dimensional Languages Generated by Transducers

Other Volumes