Implementation and application of automata. 8th international conference, CIAA 2003, Santa Barbara, CA, USA, July 16--18, 2003. Proceedings (Q1416072)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1017.00032). Indexed articles: \textit{Karhumäki, Juhani}, Automata on words (extended abstract), 3-10 [Zbl 1279.68159] \textit{Wallmeier, Nico; Hütten, Patrick; Thomas, Wolfgang}, Symbolic synthesis of finite-state controllers for request-response specifications, 11-22 [Zbl 1279.68221] \textit{Wang, Farn; Yen, Hsu-Chun}, Timing parameter characterization of real-time systems, 23-34 [Zbl 1279.68225] \textit{Fritz, Carsten}, Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata, 35-48 [Zbl 1279.68152] \textit{Champarnaud, Jean-Marc; Laugerotte, Éric; Ouardi, Faissal; Ziadi, Djelloul}, From regular weighted expressions to finite automata, 49-60 [Zbl 1279.68142] \textit{Tamm, Hellis; Ukkonen, Esko}, Bideterministic automata and minimal representations of regular languages, 61-71 [Zbl 1279.68177] \textit{van Zijl, Lynette}, Succinct descriptions of regular languages with binary \(\oplus\)-NFAs, 72-82 [Zbl 1279.68179] \textit{Allauzen, Cyril; Mohri, Mehryar}, An efficient pre-determinization algorithm, 83-95 [Zbl 1279.68125] \textit{Miyamoto, Satoru; Inenaga, Shunsuke; Takeda, Masayuki; Shinohara, Ayumi}, Ternary directed acyclic word graphs, 120-130 [Zbl 1279.68166] \textit{Guingne, Franck; Kempe, André; Nicart, Florent}, Running time complexity of printing an acyclic automaton, 131-140 [Zbl 1279.68155] \textit{Trakhtman, Avraham}, Reducing the time complexity of testing for local threshold testability, 141-149 [Zbl 1279.68178] \textit{Kuske, Dietrich; Meinecke, Ingmar}, Branching automata with costs -- a way of reflecting parallelism in costs, 150-162 [Zbl 1279.68162] \textit{Xie, Gaoyan; Li, Cheng; Dang, Zhe}, New complexity results for some linear counting problems using minimal solutions to linear Diophantine equations (extended abstract), 163-175 [Zbl 1279.68110] \textit{Wang, Farn; Hwang, Geng-Dian; Yu, Fang}, TCTL inevitability analysis of dense-time systems, 176-187 [Zbl 1279.68223] \textit{Fu, Xiang; Bultan, Tevfik; Su, Jianwen}, Conversation protocols: a formalism for specification and verification of reactive electronic services, 188-200 [Zbl 1279.68210] \textit{Ravikumar, Bala}, Weak minimization of DFA -- an algorithm and applications, 226-238 [Zbl 1279.68172] \textit{Daley, Mark; Eramian, Mark; McQuillan, Ian}, Bag automata and stochastic retrieval of biomolecules in solution, 239-250 [Zbl 1279.68145] \textit{Fan, Tsai-Hung; Lee, Shufen; Lu, Hsueh-I; Tsou, Tsung-Shan; Wang, Tsai-Cheng; Yao, Adam}, An optimal algorithm for maximum-sum segment and its application in bioinformatics (extended abstract), 251-257 [Zbl 1279.92064] \textit{Vilares, Manuel; Darriba, Victor M.; Vilares, Jesús; Rodríguez, Leandro}, Robust parsing using dynamic programming, 258-268 [Zbl 1279.68123] \textit{Castaño, José M.}, LR parsing for global index languages (GILs), 269-281 [Zbl 1279.68114] \textit{Sutner, Klaus}, The Ehrenfeucht-Mycielski sequence, 282-293 [Zbl 1279.68176] \textit{Melichar, Bořivoj; Polcar, Tomáš}, The longest common subsequence problem -- a finite automata approach, 294-296 [Zbl 1279.68165]