Invited Lectures

• 
  Markus Holzer, Martin Kutrib: Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. 1-16
• 
  Kai Salomaa: Language Decompositions, Primality, and Trajectory-Based Operations. 17-22
• 
  Mihalis Yannakakis: Automata, Probability, and Recursion. 23-32
• 
  Hsu-Chun Yen: Concurrency, Synchronization, and Conflicts in Petri Nets. 33-35

Technical Contributions

• 
  Yih-Kuen Tsay, Bow-Yaw Wang: Automated Compositional Reasoning of Intuitionistically Closed Regular Properties. 36-45
• 
  Marco Almeida, Nelma Moreira, Rogério Reis: Antimirov and Mosses's Rewrite System Revisited. 46-56
• 
  Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. 57-67
• 
  Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). 68-77
• 
  Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón: Hopcroft's Minimization Technique: Queues or Stacks?. 78-91
• 
  Pedro García, Manuel Vazquez de Parga, Gloria Inés Alvarez, José Ruiz: Learning Regular Languages Using Nondeterministic Finite Automata. 92-101
• 
  Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth: Multi-Return Macro Tree Transducers. 102-111
• 
  François Cantin, Axel Legay, Pierre Wolper: Computing Convex Hulls by Automata Iteration. 112-121
• 
  Takuya Nishiyama, Yasuhiko Minamide: A Translation from the HTML DTD into a Regular Hedge Grammar. 122-131
• 
  Andreas Maletti: Tree-Series-to-Tree-Series Transformations. 132-140
• 
  Ryan Dixon, Ömer Egecioglu, Timothy Sherwood: Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. 141-150
• 
  Jan Lahoda, Borivoj Melichar, Jan Zdárek: Pattern Matching in DCA Coded Text. 151-160
• 
  Rob J. van Glabbeek, Bas Ploeger: Five Determinisation Algorithms. 161-170
• 
  Harald Hempel, Madlen Kimmritz: Persistent Computations of Turing Machines. 171-180
• 
  Egor Dolzhenko, Natasa Jonoska: On Complexity of Two Dimensional Languages Generated by Transducers. 181-190
• 
  Zoltán Ésik, Szabolcs Iván: Games for Temporal Logics on Trees. 191-200
• 
  Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. 201-211
• 
  Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar: Composed Bisimulation for Tree Automata. 212-222
• 
  Andrew Badr: Hyper-Minimization in O(n2). 223-231
• 
  Giovanni Pighizzini: Deterministic Pushdown Automata and Unary Languages. 232-241
• 
  Benoît Razet: Finite Eilenberg Machines. 242-251
• 
  Pawel Baturo, Marcin Piatkowski, Wojciech Rytter: The Number of Runs in Sturmian Words. 252-261
• 
  Cyril Allauzen, Mehryar Mohri: 3-Way Composition of Weighted Finite-State Transducers. 262-273
• 
  Khaled El-Fakih, Nina Yevtushenko: Progressive Solutions to FSM Equations. 274-282
• 
  Akio Fujiyoshi: Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees. 283-285
• 
  Martin Simunek, Borivoj Melichar: Approximate Periods with Levenshtein Distance. 286-287

last updated on Sat May 18 05:43:45 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page