Journals in DBLP

Theor. Comput. Sci.
2000, volume: 231, number: 1

1. Pascal Caron
   LANGAGE: A Maple Package for Automaton Characterization of Regular Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:5-15 [Journal]
   
2. Mehryar Mohri, Fernando C. N. Pereira, Michael Riley
   The Design Principles of a Weighted Finite-State Transducer Library. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:17-32 [Journal]
   
3. Max Silberztein
   INTEX: An FST Toolbox. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:33-46 [Journal]
   
4. Helmut Lescow, Jens Vöge
   Minimal Separating Sets for Acceptance Conditions in Muller Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:47-57 [Journal]
   
5. A. N. Trahtman
   Optimal Estimation on the Order of Local Testability of Finite Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:59-74 [Journal]
   
6. Djelloul Ziadi
   Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:75-87 [Journal]
   
7. Jean-Luc Ponty
   An Efficient Null-Free Procedure for Deciding Regular Language Membership. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:89-101 [Journal]
   
8. Kai Salomaa, Xiuming Wu, Sheng Yu
   Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:103-111 [Journal]
   
9. Janusz A. Brzozowski, Radu Negulescu
   Automata of Asynchronous Behaviors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:231, n:1, pp:113-128 [Journal]
   
10. Denis Maurel
    Pseudo-Minimal Transducer. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:231, n:1, pp:129-139 [Journal]