Implementation and application of automata. 9th international conference, CIAA 2004, Kingston, Canada, July 22--24, 2004. Revised selected papers. (Q1780871)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1028.00030). Indexed articles: \textit{Ibarra, Oscar H.}, Automata-theoretic techniques for analyzing infinite-state systems, 1 [Zbl 1115.68439] \textit{Lee, Jonathan; Shallit, Jeffrey}, Enumerating regular expressions and their languages, 2-22 [Zbl 1115.68444] \textit{Allauzen, Cyril; Mohri, Mehryar; Roark, Brian}, A general weighted grammar library, 23-34 [Zbl 1115.68413] \textit{Berstel, Jean; Carton, Olivier}, On the complexity of Hopcroft's state minimization algorithm, 35-44 [Zbl 1115.68417] \textit{Binder, Aneta; Freund, Rudolf; Lojka, Georg; Oswald, Marion}, Implementation of catalytic P systems, 45-56 [Zbl 1115.68411] \textit{Borchardt, Björn}, Code selection by tree series transducers, 57-67 [Zbl 1115.68419] \textit{Bordihn, Henning; Holzer, Markus; Kutrib, Martin}, Some non-semi-decidability problems for linear and deterministic context-free languages, 68-79 [Zbl 1115.68420] \textit{Champarnaud, Jean-Marc; Coulon, Fabien; Paranthoën, Thomas}, Brute force determinization of NFAs by means of state covers, 80-89 [Zbl 1115.68423] \textit{Champarnaud, Jean-Marc; Nicart, Florent; Ziadi, Djelloul}, Computing the follow automaton of an expression, 90-101 [Zbl 1115.68424] \textit{Daley, Mark; McQuillan, Ian}, Viral gene compression: Complexity and verification, 102-112 [Zbl 1115.68426] \textit{Debski, Wojciech; Fraczak, Wojciech}, Concatenation state machines and simple functions, 113-124 [Zbl 1115.68427] \textit{Frishert, Michiel; Cleophas, Loek; Watson, Bruce W.}, FIRE station: An environment for manipulating finite automata and regular expression views, 125-133 [Zbl 1115.68431] \textit{Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans}, Finding finite automata that certify termination of string rewriting, 134-145 [Zbl 1115.68433] \textit{Giraud, Mathieu; Lavenier, Dominique}, Linear encoding scheme for weighted finite automata, 146-155 [Zbl 1115.68434] \textit{Han, Yo-Sub; Wood, Derick}, The generalization of generalized automata: Expression automata, 156-166 [Zbl 1115.68437] \textit{Han, Yonghua; Ma, Bin; Zhang, Kaizhong}, An automata approach to match gapped sequence tags against protein database, 167-177 [Zbl 1115.68438] \textit{Jirásek, Jozef; Jirásková, Galina; Szabari, Alexander}, State complexity of concatenation and complementation of regular languages, 178-189 [Zbl 1115.68440] \textit{John, Sebastian}, Minimal unambiguous \(\epsilon\)NFA, 190-201 [Zbl 1115.68441] \textit{Kari, Lila; Konstantinidis, Stavros; Sosík, Petr}, Substitutions, trajectories and noisy channels, 202-212 [Zbl 1115.68442] \textit{Krawetz, Bryan; Lawrence, John; Shallit, Jeffrey}, State complexity and the monoid of transformations of a finite set, 213-224 [Zbl 1115.68443] \textit{Nishimura, Harumichi; Yamakami, Tomoyuki}, An application of quantum finite automata to interactive proof systems (extended abstract), 225-236 [Zbl 1115.68447] \textit{Peng, Z. S.; Ting, H. F.}, Time and space efficient algorithms for constrained sequence alignment, 237-246 [Zbl 1115.68566] \textit{Shan, Baozhen}, Stochastic context-free graph grammars for glycoprotein modelling, 247-258 [Zbl 1115.68414] \textit{Tischler, German}, Parametric weighted finite automata for figure drawing, 259-268 [Zbl 1115.68451] \textit{Vilares, Manuel; Otero, Juan; Graña, Jorge}, Regional finite-state error repair, 269-280 [Zbl 1115.68452] \textit{Yli-Jyrä, Anssi}, Approximating dependency grammars through intersection of regular languages, 281-292 [Zbl 1115.68415] \textit{Zakharov, Vladimir; Zakharyaschev, Ivan}, On the equivalence-checking problem for a model of programs related with multi-tape automata, 293-305 [Zbl 1115.68379] \textit{Câmpeanu, Cezar; Păun, Andrei}, Tight bounds for NFA to DFCA transformations for binary alphabets, 306-307 [Zbl 1115.68422] \textit{Cojocaru, Liliana}, Simulating the process of gene assembly in ciliates, 308-309 [Zbl 1115.92311] \textit{Couvreur, Jean-Michel}, A BDD-like implementation of an automata package, 310-311 [Zbl 1115.68425] \textit{Delgado, Manuel; Morais, José}, Approximation to the smallest regular expression for a given regular language, 312-314 [Zbl 1115.68428] \textit{Egri-Nagy, Attila; Nehaniv, Chrystopher L.}, Algebraic hierarchical decomposition of finite state automata: Comparison of implementations for Krohn-Rhodes theory, 315-316 [Zbl 1115.68429] \textit{Eramian, Mark G.; Drotar, Matthew}, Does Hausdorff dimension measure texture complexity?, 317-318 [Zbl 1115.68430] \textit{Frishert, Michiel; Watson, Bruce W.}, Combining regular expressions with (near-)optimal Brzozowski automata, 319-320 [Zbl 1115.68432] \textit{Lugiez, Denis}, From automata to semilinear sets: A logical solution for sets \(\mathcal L(\mathcal C, \mathcal P)\), 321-322 [Zbl 1115.68445] \textit{Maletti, Andreas}, Myhill-Nerode theorem for sequential transducers over unique GCD-monoids, 323-324 [Zbl 1115.68446] \textit{Polák, Libor}, Minimalizations of NFA using the universal automaton, 325-326 [Zbl 1115.68448] \textit{Polcar, Tomáš; Melichar, Bořivoj}, Two-dimensional pattern matching by two-dimensional online tessellation automata, 327-328 [Zbl 1115.68449] \textit{Tamm, Hellis; Nykänen, Matti; Ukkonen, Esko}, Size reduction of multitape automata, 329-330 [Zbl 1115.68450] \textit{Xie, Gaoyan; Li, Cheng; Dang, Zhe}, Testability of oracle automata, 331-332 [Zbl 1115.68453] \textit{van Zijl, Lynette}, Magic numbers for symmetric difference NFAs, 333-334 [Zbl 1115.68455]