Implementation and Application of Automata

9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers

Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu (Herausgeber)

Buch | Softcover

XII, 336 Seiten

2005 | 2005
Springer Berlin (Verlag)
978-3-540-24318-2 (ISBN)

Artikel merken

This volume of Lecture Notes in Computer Science contains the revised versions of the papers presented at the 9th International Conference on Implemen- tion and Application of Automata, CIAA 2004. Also included are the extended abstracts of the posters accepted to the conference. The conference was held at Queen's University in Kingston, Ontario, Canada on July 22-24, 2004. As for its predecessors, the theme of CIAA 2004 was the implementation of automata and grammars of all types and their application in other ?elds. The topics of the papers presented at the conference range from applications of automata in natural language and speech processing to protein sequencingandgenecompression,andfromstatecomplexityandnewalgorithms for automata operations to applications of quantum ?nite automata. The25regularpapersand14posterpaperswereselectedfrom62submissions totheconference.EachsubmittedpaperwasevaluatedbyatleastthreeProgram Committee members, with the help of external referees. Based on the referee reports, the paper "Substitutions, Trajectories and Noisy Channels" by L. Kari, S. Konstantinidis and P. Sos´ ?k was chosen as the winner of the CIAA 2004 Best Paper Award. The award is sponsored by the University of California at Santa Barbara. The authors of the papers presented here come from the following countries and regions: Austria, Canada, Czech Republic, Finland, France, Germany, Hong Kong, Netherlands, Portugal, Russia, Slovakia, South Africa, Spain, UK, and USA.

Invited Papers.- Automata-Theoretic Techniques for Analyzing Infinite-State Systems.- Enumerating Regular Expressions and Their Languages.- Contributed Papers.- A General Weighted Grammar Library.- On the Complexity of Hopcroft's State Minimization Algorithm.- Implementation of Catalytic P Systems.- Code Selection by Tree Series Transducers.- Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages.- Brute Force Determinization of NFAs by Means of State Covers.- Computing the Follow Automaton of an Expression.- Viral Gene Compression: Complexity and Verification.- Concatenation State Machines and Simple Functions.- FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views.- Finding Finite Automata That Certify Termination of String Rewriting.- Linear Encoding Scheme for Weighted Finite Automata.- The Generalization of Generalized Automata: Expression Automata.- An Automata Approach to Match Gapped Sequence Tags Against Protein Database.- State Complexity of Concatenation and Complementation of Regular Languages.- Minimal Unambiguous ?NFA.- Substitutions, Trajectories and Noisy Channels.- State Complexity and the Monoid of Transformations of a Finite Set.- An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract).- Time and Space Efficient Algorithms for Constrained Sequence Alignment.- Stochastic Context-Free Graph Grammars for Glycoprotein Modelling.- Parametric Weighted Finite Automata for Figure Drawing.- Regional Finite-State Error Repair.- Approximating Dependency Grammars Through Intersection of Regular Languages.- On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata.- Poster Papers.- Tight Bounds for NFA to DFCATransformations for Binary Alphabets.- Simulating the Process of Gene Assembly in Ciliates.- A BDD-Like Implementation of an Automata Package.- Approximation to the Smallest Regular Expression for a Given Regular Language.- Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory.- Does Hausdorff Dimension Measure Texture Complexity?.- Combining Regular Expressions with (Near-)Optimal Brzozowski Automata.- From Automata to Semilinear Sets: A Logical Solution for Sets ( , ).- Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids.- Minimalizations of NFA Using the Universal Automaton.- Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata.- Size Reduction of Multitape Automata.- Testability of Oracle Automata.- Magic Numbers for Symmetric Difference NFAs.

Erscheint lt. Verlag	31.1.2005
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XII, 336 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	499 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	Algorithm analysis and problem complexity • algorithms • Alphabet • Automata • automata implementations • Automata Theory • Complexity • Complexity theory • concatenation state machines • Finite Automata • Finite-State Systems • Formal Languages • gene compression • generalized automata • grammar • grammar systems • Modeling • Pattern Matching • Regular Expressions • Speech processing • Term Rewriting
ISBN-10	3-540-24318-6 / 3540243186
ISBN-13	978-3-540-24318-2 / 9783540243182
Zustand	Neuware