Journals in DBLP

Journal of Automata, Languages and Combinatorics
2001, volume: 6, number: 4

1. Suna Aydin, Helmut Jürgensen, Lynda E. Robbins
   Dialogues as Co-Operating Grammars. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:395-410 [Journal]
   
2. Henning Bordihn, Markus Holzer
   On the Number of Active Symbols in L and CD Grammar Systems. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:411-426 [Journal]
   
3. Pál Dömösi, Zoltán Ésik
   Homomorphic Simulation and Letichevsky's Criterion. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:427-436 [Journal]
   
4. Christian Glaßer, Heinz Schmitz
   The Boolean Structure of Dot-Depth One. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:437-452 [Journal]
   
5. Markus Holzer, Kai Salomaa, Sheng Yu
   On the State Complexity of k-Entry Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:453-466 [Journal]
   
6. Bakhadyr Khoussainov, Sasha Rubin
   Graphs with Automatic Presentations over a Unary Alphabet. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:467-480 [Journal]
   
7. Massimiliano Milani, Giovanni Pighizzini
   Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:481-492 [Journal]
   
8. Frantisek Mráz
   Lookahead Hierarchies of Restarting Automata. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:493-506 [Journal]
   
9. Taishin Y. Nishida
   Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems. [Citation Graph (0, 0)][DBLP]
   Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:507-518 [Journal]
   
10. Alexander Okhotin
    Conjunctive Grammars. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:519-535 [Journal]
    
11. Jeffrey Shallit, Ming-wei Wang
    Automatic Complexity of Strings. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:537-554 [Journal]
    
12. K. G. Subramanian, D. G. Thomas, P. Helen Chandra, Maia Hoeberechts
    Basic Puzzle Grammars and Generation of Polygons. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:555-568 [Journal]
    
13. Yuri Velinov
    On the Regions of Influence in Complex Decomposition Forms of Finite Functions. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:569-579 [Journal]