15. CIAA 2010: Winnipeg, MB, Canada

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

Last update Fri May 25 08:48:55 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page