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