Journals in DBLP

Theor. Comput. Sci.
2001, volume: 267, number: 1-2

1. Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi
   Foreword. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:1- [Journal]
   
2. Cezar Câmpeanu, Nicolae Santean, Sheng Yu
   Minimal cover-automata for finite languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:3-16 [Journal]
   
3. Jean-Marc Champarnaud
   Subset construction complexity for homogeneous automata, position automata and ZPC-structures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:17-34 [Journal]
   
4. Jürgen Albert, Dora Giammarresi, Derick Wood
   Normal form algorithms for extended context-free grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:35-47 [Journal]
   
5. Norbert Blum
   On parsing LL-languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:49-59 [Journal]
   
6. Heiko Goeman
   On parsing and condensing substrings of LR languages in linear time. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:61-82 [Journal]
   
7. Matti Nykänen
   Using acceptors as transducers. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:83-104 [Journal]
   
8. Gérard Duchamp, Marianne Flouret, Éric Laugerotte, Jean-Gabriel Luque
   Direct and dual laws for automata with multiplicities. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:105-120 [Journal]
   
9. Denis Maurel, Brigitte Le Pévédic
   The syntactic prediction with token automata: application to HandiAS system. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:267, n:1-2, pp:121-129 [Journal]
   
10. Thierry Poibeau
    Parsing natural language idioms with bidirectional finite-state machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:267, n:1-2, pp:131-140 [Journal]
    
11. Dominique L'Her, Philippe Le Parc, Lionel Marcé
    Proving sequential function chart programs using timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:267, n:1-2, pp:141-155 [Journal]