Conferences in DBLP
David Harel , Hillel Kugler Synthesizing State-Based Object Systems from LSC Specifications. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:1-33 [Conf ] Lauri Karttunen Applications of Finite-State Transducers in Natural Language Processing. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:34-46 [Conf ] Anne Bergeron , Sylvie Hamel Fast Implementations of Automata Computations. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:47-56 [Conf ] Anne Brüggemann-Klein , Derick Wood Regularly Extended Two-Way Nondeterministic Tree Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:57-66 [Conf ] Pascal Caron , Marianne Flouret Glushkov Construction for Multiplicities. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:67-79 [Conf ] Jean-Marc Champarnaud Implicit Structures to Implement NFA's from Regular Expressions. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:80-93 [Conf ] Jean-Marc Champarnaud , Djelloul Ziadi New Finite Automaton Constructions Based on Canonical Derivatives. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:94-104 [Conf ] Jan Daciuk Experiments with Automata Compression. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:105-112 [Conf ] Frank Drewes , Sigrid Ewert , Renate Klempien-Hinrichs , Hans-Jörg Kreowski Computing Raster Images from Grid Picture Grammars. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:113-121 [Conf ] Jacques Farré , José Fortes Gálvez A Basis for Looping Extensions to Discriminating-Reverse Parsing. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:122-134 [Conf ] Pierre-Cyrille Héam Automata for Pro-V Topologies. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:135-144 [Conf ] Oscar H. Ibarra Reachability and Safety in Queue Systems. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:145-156 [Conf ] Oscar H. Ibarra , Jianwen Su Generalizing the Discrete Timed Automaton. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:157-169 [Conf ] André Kempe Factorization of Ambiguous Finite-State Transducers. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:170-181 [Conf ] Nils Klarlund , Anders Møller , Michael I. Schwartzbach MONA Implementation Secrets. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:182-194 [Conf ] Vincent Le Maout Cursors. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:195-207 [Conf ] Kamal Lodaya , Ramaswamy Ramanujam An Automaton Model of User-Controlled Navigation on the Web. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:208-216 [Conf ] Stoyan Mihov , Denis Maurel Direct Construction of Minimal Acyclic Subsequential Transducers. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:217-229 [Conf ] Mehryar Mohri Generic epsilon -Removal Algorithm for Weighted Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:230-242 [Conf ] Andrei Paun , Nicolae Santean , Sheng Yu An O(n^{2} ) Algorithm for Constructing Minimal Cover Automata for Finite Languages. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:243-251 [Conf ] Giovanni Pighizzini Unary Language Concatenation and Its State Complexity. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:252-262 [Conf ] Dominik Schmitz , Jens Vöge Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:263-271 [Conf ] Jeffrey Shallit State Complexity and Jacobsthal's Function. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:272-278 [Conf ] Priti Shankar , K. Sasidharan , Vikas Aggarwal , B. Sundar Rajan A Package for the Implementation of Block Codes as Finite Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:279-292 [Conf ] Manuel Vilares Ferro , Victor M. Darriba , Francisco J. Ribadas Regional Least-Cost Error Repair. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:293-301 [Conf ] Todd Wareham The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:302-310 [Conf ] Bruce W. Watson Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:311-317 [Conf ] Lynette van Zijl , John-Paul Harper , Frank Olivier The MERLin Environment Applied to *-NFAs. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:318-326 [Conf ] Stephan Diehl , Andreas Kerren , Torsten Weller Visual Exploration of Generation Algorithms for Finite Automata on the Web. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:327-328 [Conf ] Frank Drewes , Renate Klempien-Hinrichs TREEBAG. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:329-330 [Conf ] Jiri Dvorský , Václav Snásel Word Random Access Compression. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:331-332 [Conf ] Tamás Gaál Extended Sequentialization of Transducers. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:333-334 [Conf ] J. Howard Johnson Lessons from INR in the Specification of Transductions. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:335-336 [Conf ] André Kempe Part-of-Speech Tagging with Two Sequential Transducers. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:337-339 [Conf ] João José Neto Solving Complex Problems Efficiently with Adaptive Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2000, pp:340-342 [Conf ]