## Implementation and Application of Automata: 8th International Conference, CIAA 2003, Santa Barbara, CA, USA, July 16-18, 2003. Proceedings, Volume 8Automata theory is the foundation of computer science. Its applications have spread to almost all areas of computer science and many other disciplines. In addition, there is a growing number of software systems designed to manipulate automata, regular expressions, grammars, and related structures. This volume contains 24 regular papers from the 8th International Conference on Implementation and Application of Automata (CIAA 2003) held in Santa Barbara, CA, USA, in July 2003 covering various topics in the theory, implementation, and application of automata and related structures. It also includes the abstracts of two invited lectures as well as the abstracts of the poster papers displayed during the conference. |

### What people are saying - Write a review

### Contents

Automata for Specifying Component Interfaces | 1 |

Automata on Words Extended Abstract | 3 |

Symbolic Synthesis of FiniteState Controllers for RequestResponse Specifications | 11 |

Timing Parameter Characterization of RealTime Systems | 23 |

Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata | 35 |

From Regular Weighted Expressions to Finite Automata | 49 |

Bideterministic Automata and Minimal Representations of Regular Languages | 61 |

Succinct Descriptions of Regular Languages with Binary oplusNFAs | 72 |

Boolean Operations for AttributeElement Constraints Extended Abstract | 201 |

XML Schema Containment Checking Based on Semiimplicit Techniques | 213 |

Weak Minimization of DFA An Algorithm and Applications | 226 |

Bag Automata and Stochastic Retrieval of Biomolecules in Solution | 239 |

An Optimal Algorithm for MaximumSum Segment and Its Application in Bioinformatics Extended Abstract | 251 |

Robust Parsing Using Dynamic Programming | 258 |

LR Parsing for Global Index Languages GILs | 269 |

The EhrenfeuchtMycielski Sequence | 282 |

An Efficient Predeterminization Algorithm | 83 |

Introducing Vaucanson | 96 |

WFSC A New Weighted Finite State Compiler | 108 |

Ternary Directed Acyclic Word Graphs | 120 |

Running Time Complexity of Printing an Acyclic Automaton | 131 |

Reducing the Time Complexity of Testing for Local Threshold Testability | 141 |

Branching Automata with Costs A Way of Reflecting Parallelism in Costs | 150 |

New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations | 163 |

TCTL Inevitability Analysis of DenseTime Systems | 176 |

A Formalism for Specification and Verification of Reactive Electronic Services | 188 |

The Longest Common Subsequence Problem A Finite Automata Approach | 294 |

An Applet for Visualizing FRACTRAN and Other Automata | 297 |

Preliminary Experiments in Hardcoding Finite Automata | 299 |

Computational Linguistic Motivations for a FiniteState Machine Hierarchy | 301 |

The Effect of Rewriting Regular Expressions on Their Accepting Automata | 304 |

Building ContextSensitive Parsers from CF Grammars with Regular Control Language | 306 |

Summary | 309 |

References | 310 |

311 | |