Journals in DBLP

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

1. Janusz A. Brzozowski, Helmut Jürgensen
   Representation of semiautomata by canonical words and equivalences. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:831-850 [Journal]
   
2. Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
   Cover transducers for functions with finite domain. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:851-865 [Journal]
   
3. Zhe Dang, Oscar H. Ibarra
   On one-membrane P systems operating in sequential mode. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:867-881 [Journal]
   
4. Michael Domaratzki, Keith Ellul, Jeffrey Shallit, Ming-wei Wang
   Non-uniqueness and radius of cyclic unary NFAs. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:883-896 [Journal]
   
5. Michael Domaratzki, Kai Salomaa
   Restricted sets of trajectories and decidability of shuffle decompositions. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:897-912 [Journal]
   
6. Piotr Faliszewski, Lane A. Hemaspaandra
   Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:913-928 [Journal]
   
7. Rudolf Freund, Marion Oswald, Andrei Paun
   Optimal results for the computational completeness of gemmating (tissue) P systems. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:929-942 [Journal]
   
8. Christos A. Kapoutsis
   Non-recursive trade-offs for two-way machines. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:943-956 [Journal]
   
9. Martin Kutrib
   The phenomenon of non-recursive trade-offs. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:957-973 [Journal]
   
10. Hing Leung
    Descriptional complexity of nfa of different ambiguity. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:975-984 [Journal]
    
11. Alexander Okhotin
    A characterization of the arithmetical hierarchy by language equations. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:985-998 [Journal]
    
12. Libor Polák
    Minimalizations of NFA using the universal automaton. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:999-1010 [Journal]
    
13. Bettina Sunckel
    On the descriptional complexity of metalinear cd grammar systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:1011-1025 [Journal]
    
14. Lynette van Zijl
    Magic numbers for symmetric difference NFAS. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:1027-1038 [Journal]
    
15. Lila Kari, Stavros Konstantinidis, Petr Sosík
    Bond-free languages: formalizations, maximality and construction methods. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:1039-1070 [Journal]