Implementation and Application of Automata: 12th International Conference, CIAA 2007, Praque, Czech Republic, July 16-18, 2007, Revised Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

The 12th International Conference on Implementation and Application of - tomata CIAA 2007 washeld at the Czech Technical Universityin Prague,Czech Republic on July 16–18, 2007. These proceedings contain the papers that were presented at CIAA 2007, as well as the abstracts of the poster papers that were displayed during the conference. The proceedings also include the abstracts and extended abstracts offourinvitedlecturespresentedbyGheorghePau ? n,MichaelRiley,MosheVardi, and Bruce W. Watson. The 23 regular papers and 7 poster papers were selected from 79 submitted papers covering various topics in the theory, implementation, and application of automataandrelatedstructures.Eachsubmitted paper wasreviewedbyatleast threeProgramCommitteemembers,with the assistanceofreferees.Theauthors of the papers presented here come from the following countries: Canada, Czech Republic, Denmark, Finland, France, Germany, Greece, Israel, Italy, Poland, Romania, Russia, South Africa, Spain, Sweden, UK, and USA. We wish to thank all those who made this meeting possible: the authors for submitting papers, the Program Committee members and external referees (listed on pages VII and VIII) for their excellent work, and last but not least our four invited speakers. Finally, we wish to express our sincere appreciation to the sponsors and local organizers.

Author(s): Gheorghe Păun (auth.), Jan Holub, Jan Žďárek (eds.)
Series: Lecture Notes in Computer Science 4783 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007

Language: English
Pages: 326
Tags: Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languages

Front Matter....Pages -
Spiking Neural P Systems Used as Acceptors and Transducers....Pages 1-4
Linear-Time Model Checking: Automata Theory in Practice....Pages 5-10
OpenFst: A General and Efficient Weighted Finite-State Transducer Library....Pages 11-23
Automata Applications in Chip-Design Software....Pages 24-26
Synchronizing Automata Preserving a Chain of Partial Orders....Pages 27-37
Reducing Acyclic Cover Transducers....Pages 38-50
On-the-Fly Stuttering in the Construction of Deterministic ω -Automata....Pages 51-61
Average Value and Variance of Pattern Statistics in Rational Models....Pages 62-72
Weighted Automata and Weighted Logics with Discounting....Pages 73-84
Regulated Nondeterminism in Pushdown Automata....Pages 85-96
Deterministic Caterpillar Expressions....Pages 97-108
Backward and Forward Bisimulation Minimisation of Tree Automata....Pages 109-121
An Implementation of Deterministic Tree Automata Minimization....Pages 122-129
Accelerating Boyer Moore Searches on Binary Texts....Pages 130-143
On the Suffix Automaton with Mismatches....Pages 144-156
On String Matching in Chunked Texts....Pages 157-167
Factor Automata of Automata and Applications....Pages 168-179
Subset Seed Automaton....Pages 180-191
A Measure for the Degree of Nondeterminism of Context-Free Languages....Pages 192-202
Efficient Computation of Throughput Values of Context-Free Languages....Pages 203-213
Analyzing Ambiguity of Context-Free Grammars....Pages 214-225
Efficient Enumeration of Regular Languages....Pages 226-242
Multi-grain Relations....Pages 243-252
Memory Reduction for Strategies in Infinite Games....Pages 253-264
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms....Pages 265-276
Finite State Automata Representing Two-Dimensional Subshifts....Pages 277-289
Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages....Pages 290-302
REGAL : A Library to Randomly and Exhaustively Generate Automata....Pages 303-305
A Finite-State Super-Chunker....Pages 306-308
The Constrained Longest Common Subsequence Problem for Degenerate Strings....Pages 309-311
Finite Automata Accepting Star-Connected Languages....Pages 312-313
Efficiently Matching with Local Grammars Using Prefix Overlay Transducers....Pages 314-316
Significant Subpatterns Matching....Pages 317-319
A New Method for Compiling Parallel Replacement Rules....Pages 320-321
Back Matter....Pages -