Conferences in DBLP
Rusins Freivalds Languages Recognizable by Quantum Finite Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:1-14 [Conf ] Jacques Sakarovitch The Language, the Expression, and the (Small) Automaton. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:15-30 [Conf ] Parosh Aziz Abdulla , Johann Deneux , Lisa Kaati , Marcus Nilsson Minimization of Non-deterministic Automata with Large Alphabets. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:31-42 [Conf ] Marcella Anselmo , Maria Madonia Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata . [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:43-53 [Conf ] Arnaud Bailly , Mireille Clerbout , Isabelle Simplot-Ryl Component Composition Preserving Behavioural Contracts Based on Communication Traces. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:54-65 [Conf ] Miklós Bartha Strong Retiming Equivalence of Synchronous Schemes. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:66-77 [Conf ] Cédric Bastien , Jurek Czyzowicz , Wojciech Fraczak , Wojciech Rytter Prime Normal Form and Equivalence of Simple Grammars. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:78-89 [Conf ] Cezar Câmpeanu , Andrei Paun , Jason R. Smith An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:90-103 [Conf ] Antonio Cano , Pedro García Finite Automata and Unions of Regular Patterns with Bounded Constant Segments. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:104-115 [Conf ] Thomas Claveirole , Sylvain Lombardy , Sarah O'Connor , Louis-Noël Pouchet , Jacques Sakarovitch Inside Vaucanson. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:116-128 [Conf ] Akio Fujiyoshi , Ikuo Kawaharada Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:129-140 [Conf ] Yo-Sub Han , Derick Wood Shorter Regular Expressions from Finite-State Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:141-152 [Conf ] Johanna Högberg Wind in the Willows - Generating Music by Means of Tree Transducers. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:153-162 [Conf ] Oscar H. Ibarra , Hsu-Chun Yen On Deterministic Catalytic Systems. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:163-175 [Conf ] Tomasz Jurdzinski , Friedrich Otto Restricting the Use of Auxiliary Symbols for Restarting Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:176-187 [Conf ] André Kempe , Jean-Marc Champarnaud , Jason Eisner , Franck Guingne , Florent Nicart A Class of Rational n -WFSM Auto-intersections. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:188-198 [Conf ] Joachim Klein , Christel Baier Experiments with Deterministic omega-Automata for Formulas of Linear Temporal Logic. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:199-212 [Conf ] Louis Latour Computing Affine Hulls over Q and Z from Sets Represented by Number Decision Diagrams. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:213-224 [Conf ] Markus Lohrey , Sebastian Maneth Tree Automata and XPath on Compressed Trees. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:225-237 [Conf ] Radek Pelánek , Jan Strejcek Deeper Connections Between LTL and Alternating Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:238-249 [Conf ] Wojciech Rytter The Structure of Subword Graphs and Suffix Trees of Fibonacci Words. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:250-261 [Conf ] Christoph Schulte Althoff , Wolfgang Thomas , Nico Wallmeier Observations on Determinization of Büchi Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:262-272 [Conf ] Tamara Shcherbak The Interval Rank of Monotonic Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:273-281 [Conf ] Hariharan Subramanian , Priti Shankar Compressing XML Documents Using Recursive Finite State Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:282-293 [Conf ] Tadahiro Suda , Haruo Hosoya Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:294-306 [Conf ] Hellis Tamm , Matti Nykänen , Esko Ukkonen Size Reduction of Multitape Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:307-318 [Conf ] Manuel Vilares Ferro , Juan Otero Pombo , Jesús Vilares Ferro Robust Spelling Correction. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:319-328 [Conf ] Jan Zdárek , Borivoj Melichar On Two-Dimensional Pattern Matching by Finite Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:329-340 [Conf ] Jan Daciuk , Denis Maurel , Agata Savary Incremental and Semi-incremental Construction of Pseudo-Minimal Automata. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:341-342 [Conf ] Pedro García , José Ruiz , Antonio Cano , Gloria Alvarez Is Learning RFSAs Better Than Learning DFAs?. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:343-344 [Conf ] Colin de la Higuera , Frédéric Piat , Frédéric Tantini Learning Stochastic Finite Automata for Musical Style Recognition. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:345-346 [Conf ] Miklós Krész Simulation of Soliton Circuits. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:347-348 [Conf ] José João Morais , Nelma Moreira , Rogério Reis Acyclic Automata with Easy-to-Find Short Regular Expressions. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:349-350 [Conf ] Rimma I. Podlovchenko , Dmitry M. Rusakov , Vladimir A. Zakharov On the Equivalence Problem for Programs with Mode Switching. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:351-352 [Conf ] Isabelle Tellier Automata and AB-Categorial Grammars. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:353-355 [Conf ] Michael Vielhaber , Mónica del Pilar Canales Chacon On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set. [Citation Graph (0, 0)][DBLP ] CIAA, 2005, pp:356-357 [Conf ]