Abstract is missing.
- Automata for Specifying Component InterfacesThomas A. Henzinger. 1-2 [doi]
- Automata on WordsJuhani Karhumäki. 3-10 [doi]
- Symbolic Synthesis of Finite-State Controllers for Request-Response SpecificationsNico Wallmeier, Patrick Hütten, Wolfgang Thomas. 11-22 [doi]
- Timing Parameter Characterization of Real-Time SystemsFarn Wang, Hsu-Chun Yen. 23-34 [doi]
- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi AutomataCarsten Fritz. 35-48 [doi]
- From Regular Weighted Expressions to Finite AutomataJean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi. 49-60 [doi]
- Bideterministic Automata and Minimal Representations of Regular LanguagesHellis Tamm, Esko Ukkonen. 61-71 [doi]
- Succinct Descriptions of Regular Languages with Binary +-NFAsLynette van Zijl. 72-82 [doi]
- An Efficient Pre-determinization AlgorithmCyril Allauzen, Mehryar Mohri. 83-95 [doi]
- Introducing VAUCANSONSylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch. 96-107 [doi]
- WFSC - A New Weighted Finite State CompilerAndré Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart. 108-119 [doi]
- Ternary Directed Acyclic Word GraphsSatoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara. 120-130 [doi]
- Running Time Complexity of Printing an Acyclic AutomatonFranck Guingne, André Kempe, Florent Nicart. 131-140 [doi]
- Reducing the Time Complexity of Testing for Local Threshold TestabilityAvraham Trakhtman. 141-149 [doi]
- Branching Automata with Costs - A Way of Reflecting Parallelism in CostsDietrich Kuske, Ingmar Meinecke. 150-162 [doi]
- New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine EquationsGaoyan Xie, Cheng Li, Zhe Dang. 163-175 [doi]
- TCTL Inevitability Analysis of Dense-Time SystemsFarn Wang, Geng-Dian Hwang, Fang Yu. 176-187 [doi]
- Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic ServicesXiang Fu, Tevfik Bultan, Jianwen Su. 188-200 [doi]
- Boolean Operations for Attribute-Element ConstraintsHaruo Hosoya, Makoto Murata. 201-212 [doi]
- XML Schema Containment Checking Based on Semi-implicit TechniquesAkihiko Tozawa, Masami Hagiya. 213-225 [doi]
- Weak Minimization of DFA - An Algorithm and ApplicationsBala Ravikumar. 226-238 [doi]
- Bag Automata and Stochastic Retrieval of Biomolecules in SolutionMark Daley, Mark G. Eramian, Ian McQuillan. 239-250 [doi]
- An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended AbstractTsai-Hung Fan, Shufen Lee, Hsueh-I Lu, Tsung-Shan Tsou, Tsai-Cheng Wang, Adam Yao. 251-257 [doi]
- Robust Parsing Using Dynamic ProgrammingManuel Vilares Ferro, Victor M. Darriba, Jesús Vilares Ferro, Leandro Rodríguez Liñares. 258-268 [doi]
- LR Parsing for Global Index Languages (GILs)José M. Castaño. 269-281 [doi]
- The Ehrenfeucht-Mycielski SequenceKlaus Sutner. 282-293 [doi]
- The Longest Common Subsequence Problem A Finite Automata ApproachBorivoj Melichar, Tomás Polcar. 294-296 [doi]
- AVA: An Applet for Visualizing FRACTRAN and Other AutomataNathan Preston, Mukkai S. Krishnamoorthy. 297-298 [doi]
- Preliminary Experiments in Hardcoding Finite AutomataErnest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie. 299-300 [doi]
- Computational Linguistic Motivations for a Finite-State Machine HierarchyRobert Kelly, Julie Carson-Berndsen. 301-303 [doi]
- The Effect of Rewriting Regular Expressions on Their Accepting AutomataMichiel Frishert, Loek G. Cleophas, Bruce W. Watson. 304-305 [doi]
- Building Context-Sensitive Parsers from CF Grammars with Regular Control LanguageCésar Bravo, João José Neto. 306-308 [doi]
- Finite-State Molecular ComputingOlgierd Unold, Maciej Troc, Tadeusz Dobosz, Alicja Trusewicz. 309-310 [doi]