Abstract is missing.
- Using Automata to Describe Self-Assembled NanostructuresNatasa Jonoska. 1-3 [doi]
- A Summary of Some Discrete-Event System Control ProblemsKaren Rudie. 4-16 [doi]
- Large-Scale Training of SVMs with Automata KernelsCyril Allauzen, Corinna Cortes, Mehryar Mohri. 17-27 [doi]
- Filters for Efficient Composition of Weighted Finite-State TransducersCyril Allauzen, Michael Riley, Johan Schalkwyk. 28-38 [doi]
- Incremental DFA MinimisationMarco Almeida, Nelma Moreira, Rogério Reis. 39-48 [doi]
- Finite Automata for Generalized Approach to Backward Pattern MatchingJan Antos, Borivoj Melichar. 49-58 [doi]
- Partial Derivative Automata Formalized in CoqJosé Bacelar Almeida, Nelma Moreira, David Pereira, Simão Melo de Sousa. 59-68 [doi]
- Regular Geometrical Languages and Tiling the PlaneJean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne. 69-78 [doi]
- COMPAS - A Computing Package for SynchronizationKrzysztof Chmiel, Adam Roman. 79-86 [doi]
- From Sequential Extended Regular Expressions to NFA with Symbolic LabelsAlessandro Cimatti, Sergio Mover, Marco Roveri, Stefano Tonetta. 87-94 [doi]
- State Complexity of Catenation Combined with Union and IntersectionBo Cui, Yuan Gao, Lila Kari, Sheng Yu. 95-104 [doi]
- Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)Volker Diekert, Steffen Kopecki. 105-114 [doi]
- On Straight Words and Minimal Permutators in Finite Transformation SemigroupsAttila Egri-Nagy, Chrystopher L. Nehaniv. 115-124 [doi]
- On Lazy Representations and Sturmian GraphsChiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit. 125-134 [doi]
- Symbolic Dynamics, Flower Automata and Infinite TracesWit Forys, Piotr Oprocha, Slawomir Bakalarski. 135-142 [doi]
- The Cayley-Hamilton Theorem for Noncommutative SemiringsRadu Grosu. 143-153 [doi]
- Approximating Minimum Reset SequencesMichael Gerbush, Brent Heeringa. 154-162 [doi]
- Transductions Computed by PC-Systems of Monotone Deterministic Restarting AutomataNorbert Hundeshagen, Friedrich Otto, Marcel Vollweiler. 163-172 [doi]
- Uniformizing Rational Relations for Natural Language Applications Using Weighted DeterminizationJ. Howard Johnson. 173-180 [doi]
- Partially Ordered Two-Way Büchi AutomataManfred Kufleitner, Alexander Lauser. 181-190 [doi]
- Two-Party Watson-Crick ComputationsMartin Kutrib, Andreas Malcher. 191-200 [doi]
- Better Hyper-minimization - Not as Fast, But Fewer ErrorsAndreas Maletti. 201-210 [doi]
- Regular Expressions on Average and in the Long RunManfred Droste, Ingmar Meinecke. 211-221 [doi]
- Reachability Games on Automatic GraphsDaniel Neider. 222-230 [doi]
- Disambiguation in Regular Expression Matching via Position Automata with Augmented TransitionsSatoshi Okui, Taro Suzuki. 231-240 [doi]
- A Polynomial Time Match Test for Large Classes of Extended Regular ExpressionsDaniel Reidenbach, Markus L. Schmid. 241-250 [doi]
- A Challenging Family of Automata for Classical Minimization AlgorithmsGiusi Castiglione, Cyril Nicaud, Marinella Sciortino. 251-260 [doi]
- State of Büchi ComplementationMing-Hsien Tsai, Seth Fogarty, Moshe Y. Vardi, Yih-Kuen Tsay. 261-271 [doi]
- Types of Trusted Information That Make DFA Identification with Correction Queries FeasibleCristina Tîrnauca, Catalin Ionut Tîrnauca. 272-281 [doi]
- Compressing Regular Expressions DFA Table by Matrix DecompositionYanbing Liu, Li Guo, Ping Liu, Jianlong Tan. 282-289 [doi]
- Relational String Verification Using Multi-track AutomataFang Yu, Tevfik Bultan, Oscar H. Ibarra. 290-299 [doi]
- A Note on a Tree-Based 2D IndexingJan Zdárek, Borivoj Melichar. 300-309 [doi]
- Regular Expressions at Their Best: A Case for Rational DesignVincent Le Maout. 310-320 [doi]
- Simulations of Weighted Tree AutomataZoltán Ésik, Andreas Maletti. 321-330 [doi]