Implementation and Application of Automata: 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / Edition 1

Implementation and Application of Automata: 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / Edition 1

by Michael Domaratzki
     
 

ISBN-10: 3540243186

ISBN-13: 9783540243182

Pub. Date: 03/24/2005

Publisher: Springer Berlin Heidelberg

This book constitutes the thoroughly refereed post-proceedings of the 9th International Conference on Implementation and Application of Automata, CIAA 2004, held in Kingston, Canada in July 2004.

The 25 revised full papers and 14 revised poster papers presented together with 2 invited contributions have gone through two rounds of reviewing and improvement. The

Overview

This book constitutes the thoroughly refereed post-proceedings of the 9th International Conference on Implementation and Application of Automata, CIAA 2004, held in Kingston, Canada in July 2004.

The 25 revised full papers and 14 revised poster papers presented together with 2 invited contributions have gone through two rounds of reviewing and improvement. The topics covered range from applications of automata in natural language and speech processing to protein sequencing and gene compression, and from state complexity and new algorithms for automata operations to applications of quantum finite automata.

Product Details

ISBN-13:
9783540243182
Publisher:
Springer Berlin Heidelberg
Publication date:
03/24/2005
Series:
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Series, #3317
Edition description:
2005
Pages:
336
Product dimensions:
6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

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.- Shastic 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 DFCA Transformations 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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >