The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Mehryar Mohri
    Edit-Distance of Weighted Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:1-23 [Conf]
  2. Cyril Allauzen, Mehryar Mohri
    p-Subsequentiable Transducers. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:24-34 [Conf]
  3. Miguel A. Alonso, Víctor J. Díaz, Manuel Vilares Ferro
    Tabulation of Bidirectional Push Down Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:35-46 [Conf]
  4. Marcella Anselmo, Dora Giammarresi, Stefano Varricchio
    Finite Automata and Non-self-Embedding Grammars. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:47-56 [Conf]
  5. Janusz A. Brzozowski, Mihaela Gheorghiu
    Simulation of Gate Circuits in the Algebra of Transients. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:57-66 [Conf]
  6. Cezar Câmpeanu, Andrei Paun
    The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:67-76 [Conf]
  7. Cezar Câmpeanu, Kai Salomaa, Sheng Yu
    Regex and Extended Regex. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:77-84 [Conf]
  8. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
    Prime Decompositions of Regular Prefix Codes. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:85-94 [Conf]
  9. Abolfazl Fatholahzadeh
    Implementation of Dictionaries via Automata and Decision Trees. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:95-105 [Conf]
  10. Mihaela Gheorghiu, Janusz A. Brzozowski
    Feedback-Free Circuits in the Algebra of Transients. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:106-116 [Conf]
  11. Heiko Körner
    On Minimizing Cover Automata for Finite Languages in O(n log n) Time. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:117-127 [Conf]
  12. Jorge Graña, Gloria Andrade, Jesús Vilares
    Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:128-137 [Conf]
  13. Franck Guingne, Florent Nicart
    Finite State Lazy Operations in NLP. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:138-147 [Conf]
  14. Markus Holzer, Martin Kutrib
    State Complexity of Basic Operations on Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:148-157 [Conf]
  15. João José Neto, César Bravo
    Adaptive Automata - A Revisited Proposal. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:158-168 [Conf]
  16. Alexander Okhotin
    Efficient Automaton-Based Recognition for Linear Conjunctive Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:169-181 [Conf]
  17. Libor Polák
    Syntactic Semiring and Language Equations. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:182-193 [Conf]
  18. Klaus Sutner
    Reduced Power Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:194-202 [Conf]
  19. A. N. Trahtman
    A Polynomial Time Algorithm for Left [Right] Local Testability. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:203-212 [Conf]
  20. Alexander Okhotin
    Whale Calf, a Parser Generator for Conjunctive Grammars. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:213-220 [Conf]
  21. Klaus Sutner
    automata, a Hybrid System for Computational Automata Theory. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:221-227 [Conf]
  22. A. N. Trahtman
    A Package TESTAS for Checking Some Kinds of Testability. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:228-232 [Conf]
  23. Miroslav Balík
    DAWG versus Suffix Array. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:233-238 [Conf]
  24. Anne Brüggemann-Klein, Derick Wood
    On Predictive Parsing and Extended Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:239-247 [Conf]
  25. Pascal Caron, Marianne Flouret
    Star Normal Form, Rational Expressions, and Glushkov WFAs Properties. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:248-254 [Conf]
  26. Jan Daciuk
    Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:255-261 [Conf]
  27. Gaëlle Largeteau, Dominique Geniet
    Term Validation of Distributed Hard Real-Time Applications. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:262-269 [Conf]
  28. Zdenek Tronícek
    Common Subsequence Automaton. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:270-275 [Conf]
  29. Manuel Vilares Ferro, Victor M. Darriba, Miguel A. Alonso
    Searching for Asymptotic Error Repair. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:276-281 [Conf]
  30. Constantinos Bartzis, Tevfik Bultan
    Automata-Based Representations for Arithmetic Constraints in Automated Verification. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:282-288 [Conf]
  31. Jan Holub, Maxime Crochemore
    On the Implementation of Compact DAWG's. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:289-294 [Conf]
  32. Jan Holub
    Dynamic Programming - NFA Simulation. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:295-300 [Conf]
  33. Borivoj Melichar
    Deterministic Parsing of Cyclic Strings. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:301-306 [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