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

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Domaratzki, Michael (Editor ), Okhotin, Alexander (Editor ), Salomaa, Kai (Editor ), Yu, Sheng (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Theoretical Computer Science and General Issues, 3317
Temas:
Artificial intelligence.
Computer science.
Machine theory.
Algorithms.
Artificial Intelligence.
Theory of Computation.
Formal Languages and Automata Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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 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.

Ejemplares similares