The SCEAS System
Navigation Menu

Conferences in DBLP

Conference on Implementation and Application of Automata (CIAA) (wia)
2005 (conf/wia/2005)

  1. Rusins Freivalds
    Languages Recognizable by Quantum Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:1-14 [Conf]
  2. Jacques Sakarovitch
    The Language, the Expression, and the (Small) Automaton. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:15-30 [Conf]
  3. 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]
  4. Marcella Anselmo, Maria Madonia
    Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata . [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:43-53 [Conf]
  5. 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]
  6. Miklós Bartha
    Strong Retiming Equivalence of Synchronous Schemes. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:66-77 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. Yo-Sub Han, Derick Wood
    Shorter Regular Expressions from Finite-State Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:141-152 [Conf]
  13. 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]
  14. Oscar H. Ibarra, Hsu-Chun Yen
    On Deterministic Catalytic Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:163-175 [Conf]
  15. Tomasz Jurdzinski, Friedrich Otto
    Restricting the Use of Auxiliary Symbols for Restarting Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:176-187 [Conf]
  16. 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]
  17. 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]
  18. 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]
  19. Markus Lohrey, Sebastian Maneth
    Tree Automata and XPath on Compressed Trees. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:225-237 [Conf]
  20. Radek Pelánek, Jan Strejcek
    Deeper Connections Between LTL and Alternating Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:238-249 [Conf]
  21. Wojciech Rytter
    The Structure of Subword Graphs and Suffix Trees of Fibonacci Words. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:250-261 [Conf]
  22. 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]
  23. Tamara Shcherbak
    The Interval Rank of Monotonic Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:273-281 [Conf]
  24. Hariharan Subramanian, Priti Shankar
    Compressing XML Documents Using Recursive Finite State Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:282-293 [Conf]
  25. 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]
  26. Hellis Tamm, Matti Nykänen, Esko Ukkonen
    Size Reduction of Multitape Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:307-318 [Conf]
  27. Manuel Vilares Ferro, Juan Otero Pombo, Jesús Vilares Ferro
    Robust Spelling Correction. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:319-328 [Conf]
  28. Jan Zdárek, Borivoj Melichar
    On Two-Dimensional Pattern Matching by Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:329-340 [Conf]
  29. 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]
  30. 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]
  31. 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]
  32. Miklós Krész
    Simulation of Soliton Circuits. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:347-348 [Conf]
  33. 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]
  34. 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]
  35. Isabelle Tellier
    Automata and AB-Categorial Grammars. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:353-355 [Conf]
  36. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002