Implementation and Applications of Automata

This book constitutes the thoroughly refereed post-proceedings of the 13th International Conference on Implementation and Application of Automata, CIAA 2008, held in San Francisco, USA, in July 2008.

The 26 revised full papers togehter with 4 invited papers were carefully reviewed and selected from 40 submissions and have gone through two rounds of reviewing and improvement. The papers cover various topics in the theory, implementation, and applications of automata and related structures.

Klappentext

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.

Inhalt

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.- Games for Temporal Logics on Trees.- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.- Composed Bisimulation for Tree Automata.- Hyper-Minimization in O(n 2).- Deterministic Pushdown Automata and Unary Languages.- Finite Eilenberg Machines.- The Number of Runs in Sturmian Words.- 3-Way Composition of Weighted Finite-State Transducers.- Progressive Solutions to FSM Equations.- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees.- Approximate Periods with Levenshtein Distance.