Conferences in DBLP

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

1. Thomas A. Henzinger
   Automata for Specifying Component Interfaces. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:1-2 [Conf]
   
2. Juhani Karhumäki
   Automata on Words. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:3-10 [Conf]
   
3. Nico Wallmeier, Patrick Hütten, Wolfgang Thomas
   Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:11-22 [Conf]
   
4. Farn Wang, Hsu-Chun Yen
   Timing Parameter Characterization of Real-Time Systems. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:23-34 [Conf]
   
5. Carsten Fritz
   Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:35-48 [Conf]
   
6. Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi
   From Regular Weighted Expressions to Finite Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:49-60 [Conf]
   
7. Hellis Tamm, Esko Ukkonen
   Bideterministic Automata and Minimal Representations of Regular Languages. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:61-71 [Conf]
   
8. Lynette van Zijl
   Succinct Descriptions of Regular Languages with Binary +-NFAs. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:72-82 [Conf]
   
9. Cyril Allauzen, Mehryar Mohri
   An Efficient Pre-determinization Algorithm. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:83-95 [Conf]
   
10. Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch
    Introducing VAUCANSON. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:96-107 [Conf]
    
11. André Kempe, Christof Baeijs, Tamás Gaál, Franck Guingne, Florent Nicart
    WFSC - A New Weighted Finite State Compiler. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:108-119 [Conf]
    
12. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
    Ternary Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:120-130 [Conf]
    
13. Franck Guingne, André Kempe, Florent Nicart
    Running Time Complexity of Printing an Acyclic Automaton. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:131-140 [Conf]
    
14. Avraham Trakhtman
    Reducing the Time Complexity of Testing for Local Threshold Testability. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:141-149 [Conf]
    
15. Dietrich Kuske, Ingmar Meinecke
    Branching Automata with Costs - A Way of Reflecting Parallelism in Costs. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:150-162 [Conf]
    
16. Gaoyan Xie, Cheng Li, Zhe Dang
    New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:163-175 [Conf]
    
17. Farn Wang, Geng-Dian Hwang, Fang Yu
    TCTL Inevitability Analysis of Dense-Time Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:176-187 [Conf]
    
18. Xiang Fu, Tevfik Bultan, Jianwen Su
    Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:188-200 [Conf]
    
19. Haruo Hosoya, Makoto Murata
    Boolean Operations for Attribute-Element Constraints. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:201-212 [Conf]
    
20. Akihiko Tozawa, Masami Hagiya
    XML Schema Containment Checking Based on Semi-implicit Techniques. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:213-225 [Conf]
    
21. Bala Ravikumar
    Weak Minimization of DFA - An Algorithm and Applications. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:226-238 [Conf]
    
22. Mark Daley, Mark G. Eramian, Ian McQuillan
    Bag Automata and Stochastic Retrieval of Biomolecules in Solution. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:239-250 [Conf]
    
23. Tsai-Hung Fan, Shufen Lee, Hsueh-I Lu, Tsung-Shan Tsou, Tsai-Cheng Wang, Adam Yao
    An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:251-257 [Conf]
    
24. Manuel Vilares Ferro, Victor M. Darriba, Jesús Vilares Ferro, Leandro Rodríguez Liñares
    Robust Parsing Using Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:258-268 [Conf]
    
25. José M. Castaño
    LR Parsing for Global Index Languages (GILs). [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:269-281 [Conf]
    
26. Klaus Sutner
    The Ehrenfeucht-Mycielski Sequence. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:282-293 [Conf]
    
27. Borivoj Melichar, Tomás Polcar
    The Longest Common Subsequence Problem A Finite Automata Approach. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:294-296 [Conf]
    
28. Nathan Preston, Mukkai S. Krishnamoorthy
    AVA: An Applet for Visualizing FRACTRAN and Other Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:297-298 [Conf]
    
29. Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie
    Preliminary Experiments in Hardcoding Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:299-300 [Conf]
    
30. Robert Kelly, Julie Carson-Berndsen
    Computational Linguistic Motivations for a Finite-State Machine Hierarchy. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:301-303 [Conf]
    
31. Michiel Frishert, Loek G. Cleophas, Bruce W. Watson
    The Effect of Rewriting Regular Expressions on Their Accepting Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:304-305 [Conf]
    
32. César Bravo, João José Neto
    Building Context-Sensitive Parsers from CF Grammars with Regular Control Language. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:306-308 [Conf]
    
33. Olgierd Unold, Maciej Troc, Tadeusz Dobosz, Alicja Trusewicz
    Finite-State Molecular Computing. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:309-310 [Conf]