Front matter
128-142
Automata for Specifying Component Interfaces
Thomas A. Henzinger
3-11
Automata on Words
Extended Abstract
Juhani Karhumäki
113-127
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
Nico Wallmeier, Patrick Hütten and Wolfgang Thomas
1-10
Timing Parameter Characterization of Real-Time Systems
Farn Wang and Hsu-Chun Yen
35-48
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata
Carsten Fritz
213-238
From Regular Weighted Expressions to Finite Automata
Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi and Djelloul Ziadi
141-162
Bideterministic Automata and Minimal Representations of Regular Languages
Hellis Tamm and Esko Ukkonen
281-305
Succinct Descriptions of Regular Languages with Binary ⊕-NFAs
Lynette van Zijl
14-19
An Efficient Pre-determinization Algorithm
Cyril Allauzen and Mehryar Mohri
107-134
Introducing Vaucanson
Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas and Jacques Sakarovitch
1-14
WFSC — A New Weighted Finite State Compiler
André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne and Florent Nicart
120-130
Ternary Directed Acyclic Word Graphs
Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda and Ayumi Shinohara
20-34
Running Time Complexity of Printing an Acyclic Automaton
Franck Guingne, André Kempe and Florent Nicart
70-110
Reducing the Time Complexity of Testing for Local Threshold Testability
Avraham Trakhtman
114-118
Branching Automata with Costs — A Way of Reflecting Parallelism in Costs
Dietrich Kuske and Ingmar Meinecke
83-105
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
Extended Abstract
Gaoyan Xie, Cheng Li and Zhe Dang
176-186
TCTL Inevitability Analysis of Dense-Time Systems
Farn Wang, Geng-Dian Hwang and Fang Yu
189-212
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services
Xiang Fu, Tevfik Bultan and Jianwen Su
259-268
Boolean Operations for Attribute-Element Constraints
Extended Abstract
Haruo Hosoya and Makoto Murata
51-61
XML Schema Containment Checking Based on Semi-implicit Techniques
Akihiko Tozawa and Masami Hagiya
5-9
Weak Minimization of DFA — An Algorithm and Applications
Bala Ravikumar
191-204
Bag Automata and Stochastic Retrieval of Biomolecules in Solution
Mark Daley, Mark Eramian and Ian McQuillan
46-66
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics
Extended Abstract
Tsai-Hung Fan, Shufen Lee, Hsueh-I Lu, Tsung-Shan Tsou and Tsai-Cheng Wang, et al.
121-129
Robust Parsing Using Dynamic Programming
Manuel Vilares, Victor M. Darriba, Jesús Vilares and Leandro Rodríguez
191-225
LR Parsing for Global Index Languages (GILs)
José M. Castaño
73-82
The Ehrenfeucht-Mycielski Sequence
Klaus Sutner
93-106
The Longest Common Subsequence Problem A Finite Automata Approach
Bořivoj Melichar and Tomáš Polcar
58-62
AVA: An Applet for Visualizing FRACTRAN and Other Automata
Nathan Preston and Mukkai S. Krishnamoorthy
33-40
Preliminary Experiments in Hardcoding Finite Automata
E. Ketcha Ngassam, Bruce. W. Watson and Derrick. G. Kourie
301-303
Computational Linguistic Motivations for a Finite-State Machine Hierarchy
Robert Kelly and Julie Carson-Berndsen
304-306
The Effect of Rewriting Regular Expressions on Their Accepting Automata
Michiel Frishert, Loek G. Cleophas and Bruce W. Watson
105-119
Building Context-Sensitive Parsers from CF Grammars with Regular Control Language
César Bravo and João José Neto
157-170
Finite-State Molecular Computing
Olgierd Unold, Maciej Troć, Tadeusz Dobosz and Alicja Trusewicz
Back matter