Volume 10,
1980
- Claus-Peter Schnorr, Jean-Paul Van de Wiele:
On the Additive Complexity of Polynomials.
1-18 BibTeX
- Janusz A. Brzozowski, Ernst L. Leiss:
On Equations for Regular Languages, Finite Automata, and Sequential Networks.
19-35 BibTeX
- Petr Kurka:
Applicability of a Production in a Categorical Grammar.
37-44 BibTeX
- Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Every Two Equivalent D0L Systems have a Regular True Envelope.
45-52 BibTeX
- Werner Hartmann, Peter Schuster:
Multiplicative Complexity of some Rational Functions.
53-61 BibTeX
- Shmuel Zaks:
Lexicographic Generation of Ordered Trees.
63-82 BibTeX
- Claus-Peter Schnorr:
A 3n-Lower Bound on the Network Complexity of Boolean Functions.
83-92 BibTeX
- Joachim Biskup:
Inferences of Multivalued Dependencies in Fixed and Undetermined Universes.
93-105 BibTeX
- Helmut Prodinger:
On the Interpolation of D0L-Sequences.
107-108 BibTeX
- Steven Fortune, John E. Hopcroft, James Wyllie:
The Directed Subgraph Homeomorphism Problem.
111-121 BibTeX
- Karl J. Lieberherr:
P-Optimal Heuristics.
123-131 BibTeX
- E. Wiedmer:
Computing with Infinite Objects.
133-155 BibTeX
- Aldo de Luca, Antonio Restivo:
On Some Properties of Very Pure Codes.
157-170 BibTeX
- John Staples:
Computation on Graph-Like Expressions.
171-185 BibTeX
- Ivan M. Havel:
On Branching and Looping, Part I.
187-220 BibTeX
- Dexter Kozen:
Complexity of Boolean Algebras.
221-247 BibTeX
- Rina S. Cohen, Arie Y. Gold:
On the Complexity of omega-Type Turing Acceptors.
249-272 BibTeX
- Ivan M. Havel:
On Branching and Looping, Part II.
273-295 BibTeX
- John Staples:
Optimal Evaluations of Graph-Like Expressions.
297-316 BibTeX
- K. N. King:
Iteration Theorems for Families of Strict Deterministic Languages.
317-333 BibTeX
- Michael Sipser:
Halting Space-Bounded Computations.
335-338 BibTeX
Copyright © Sun May 17 00:23:46 2009
by Michael Ley (ley@uni-trier.de)
