Volume 43,
1986
- Jerzy W. Grzymala-Busse, Zamir Bavel:
Characterization of State-Independent Automata.
1-10
- Arnold Scheuing:
Decomposition of Linear Automata over Residue Rings Into Shift-Registers.
11-30
- Christian Ronse:
A Topological Characterization of Thinning.
31-41
- Leslie M. Goldschlager, Ian Parberry:
On the Construction of Parallel Computers from Various Bases of Boolean Functions.
43-58
- Roman R. Redziejowski:
Infinite-Word Languages and Continuous Mappings.
59-79
- Ewa Orlowska:
Semantic Analysis of Inductive Reasoning.
81-89
- Georges Hansel:
Une Démonstration Simple du Théorème de Skolem-Mahler-Lech.
91-98
- Peter Clote:
On the Finite Containment Problem for Petri Nets.
99-105
- Peter A. Lindsay:
Alternation and omega-Type Turing Acceptors.
107-115
- Michael H. Albert, J. Lawrence:
Test Sets for Finite Substitutions.
117-122
- Rudolf Berghammer, Hans Zierer:
Relational Algebraic Semantics of Deterministic and Nondeterministic Programs.
123-147
- Jan Heering:
Partial Evaluation and omega-Completeness of Algebraic Specifications.
149-167
- Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani:
Random Generation of Combinatorial Structures from a Uniform Distribution.
169-188
- François Fages, Gérard P. Huet:
Complete Sets of Unifiers and Matchers in Equational Theories.
189-200
- Ingo Wegener:
More on the Complexity of Slice Functions.
201-211
- Ryszard Janicki, Peter E. Lauer, Maciej Koutny, Raymond R. Devillers:
Concurrent and Maximally Concurrent Evolution of Nonsequential Systems.
213-238
- Gad M. Landau, Uzi Vishkin:
Efficient String Matching with k Mismatches.
239-249
- Ana Pasztor, Richard Statman:
Scott Induction and Closure under omega-Sups.
251-263
- Aldo de Luca, Antonio Restivo:
Star-Free Sets of Integers.
265-275
- Ichiro Suzuki, Y. Motohashi, Kenichi Taniguchi, Tadao Kasami, Tatsuaki Okamoto:
Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions.
277-291
- Jirí Adámek, Jan Reiterman, Evelyn Nelson:
Continuous Semilattices.
293-313
- Ahmed Saoudi:
Variétés d'Automates Descendants d'Arbres Infinis.
315-335
- Keith Edwards:
The Complexity of Colouring Problems on Dense Graphs.
337-343
- Donald B. Johnson:
A Simple Proof of a Time-Space Trade-Off for Sorting with Linear Comparisons.
345-350
Copyright © Tue Dec 8 20:31:01 2009
by Michael Ley (ley@uni-trier.de)
