Journals in DBLP

Int. J. Found. Comput. Sci.
2005, volume: 16, number: 3

1. Kai Salomaa, Sheng Yu
   Preface. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:399-401 [Journal]
   
2. Cyril Allauzen, Mehryar Mohri, Brian Roark
   The design principles and algorithms of a weighted grammar library. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:403-421 [Journal]
   
3. Henning Bordihn, Markus Holzer, Martin Kutrib
   Unsolvability levels of operation problems for subclasses of context-free languages. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:423-440 [Journal]
   
4. Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën
   Brute force determinization of nfas by means of state covers. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:441-451 [Journal]
   
5. Mark Daley, Ian McQuillan
   Formal modelling of viral gene compression. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:453-469 [Journal]
   
6. Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
   Finding finite automata that certify termination of string rewriting systems. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:471-486 [Journal]
   
7. Yonghua Han, Bin Ma, Kaizhong Zhang
   An automata approach to match gapped sequence tags against protein database. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:487-497 [Journal]
   
8. Yo-Sub Han, Derick Wood
   The generalization of generalized automata: expression automata. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:499-510 [Journal]
   
9. Jozef Jirásek, Galina Jirásková, Alexander Szabari
   State complexity of concatenation and complementation. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:511-529 [Journal]
   
10. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Operations on trajectories with applications to coding and bioinformatics. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:531-546 [Journal]
    
11. Bryan Krawetz, John Lawrence, Jeffrey Shallit
    State complexity and the monoid of transformations of a finite set. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:547-563 [Journal]
    
12. Anssi Yli-Jyrä
    Approximating dependency grammars through intersection of star-free regular languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:565-579 [Journal]
    
13. Stanley P. Y. Fung, Francis Y. L. Chin, Hong Shen
    Online scheduling of unit jobs with bounded importance ratio. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:581-598 [Journal]
    
14. K. Subramani
    Cascading random walks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:599-622 [Journal]