Journals in DBLP

Fundam. Inform.
1999, volume: 38, number: 1-2

1. Amir M. Ben-Amram, Neil D. Jones
   A Precise Version of a Time Hierarchy Theorem. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:1-15 [Journal]
   
2. Martti Penttonen
   Relative Cost Random Access Machines. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:17-23 [Journal]
   
3. Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup
   The Complexity of Identifying Large Equivalence Classes. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:25-37 [Journal]
   
4. Merja Wanne, Matti Linna
   A General Model for Adjacency. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:39-50 [Journal]
   
5. Stojan Bogdanovic, Miroslav Ciric, Tatjana Petkovic, Balázs Imreh, Magnus Steinby
   Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:51-60 [Journal]
   
6. Mogens Nielsen, Thomas Hune
   Bisimulation and Open Maps for Timed Transition Systems. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:61-77 [Journal]
   
7. Eija Jurvanen, Marjo Lipponen
   Distinguishability, Simulation and Universality of Moore Tree Automata. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:79-91 [Journal]
   
8. Jarkko Kari
   On the Circuit Depth of Structurally Reversible Cellular Automata. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:93-107 [Journal]
   
9. Lucian Ilie
   Subwords and Power-Free Words are not Expressible by Word Equations. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 1999, v:38, n:1-2, pp:109-118 [Journal]
   
10. Juhani Karhumäki, Sabrina Mantaci
    Defect Theorems for Trees. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:119-133 [Journal]
    
11. Keijo Ruohonen
    Solving Equivalence of Recurrent Sequences in Groups by Polynomial Manipulation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:135-148 [Journal]
    
12. Cunsheng Ding, Kwok-Yan Lam, Chaoping Xing
    Construction and Enumeration of All Binary Duadic Codes of Length p^m. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:149-161 [Journal]
    
13. Jukka A. Koskinen
    Non-Injectivity and Knapsacks. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:163-180 [Journal]
    
14. Valtteri Niemi, Ari Renvall
    Solitaire Zero-knowledge. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:181-188 [Journal]
    
15. Vesa Halava, Tero Harju
    Undecidability in Integer Weighted Finite Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:189-200 [Journal]
    
16. Juha Honkala
    The Equivalence Problem of D0L and DF0L Power Series. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:201-208 [Journal]
    
17. Paavo Turakainen
    On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:209-221 [Journal]