Abstract is missing.
- Methods for Generating Deterministic Fractals and Image CompressionKarel Culik II, Simant Dube. 2-28
- Optimum Simulation of Meshes by Small HypercubesBin Cong, Zevi Miller, Ivan Hal Sudborough. 30-46
- Seven Hard Problems in Symbolic Background Knowledge AcquisitionYves Kodratoff. 47-61
- Subsequential Functions: Characterizations, Minimization, ExamplesChristophe Reutenauer. 62-79
- Past Proves More Invariance Properties but not PCA sIldikó Sain. 80-92
- Complexity Issues in Discrete NeurocomputingJuraj Wiedermann. 93-108
- Two-Way Reading on WordsMarcella Anselmo. 110-119
- Proofs and Reachablity Problem for Ground Rewrite SystemsJean-Luc Coquidé, Rémi Gilleron. 120-129
- Problems Complete for +LCarsten Damm. 130-137
- Constructive Matching - Explanation Based Methodology for Inductive Theorem ProvingMarta Frañová. 138-147
- Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part IIAndreas Goerdt, Helmut Seidl. 148-158
- The Distributed Termination Problem: Formal Solution and Correctness Based on Petri NetsDominik Gomm, Rolf Walter. 159-168
- Greedy Compression SystemsMartin Loebl. 169-176
- A Div(n) Depth Boolean Circuit for Smooth Modular InverseMichael Mñuk. 177-183
- Learning by Conjugate GradientsMartin Fodslette Møller. 184-194
- Monoids Described by Pushdown AutomataMaryse Pelletier. 195-203
- Optimal Parallel 3-Colouring Algorithm for Rooted Trees and Its ApplicationPeter Rajcáni. 204-213
- Hierarchies over the Context-Free LanguagesKlaus Reinhardt. 214-224
- A Hierarchy of Unary Primitive Recursive String-FunctionsLila Santean. 225-233
- Minimizing Picture WordsPatrice Séébold, Karine Slowinski. 234-243
- Remarks on the Frequency-Coded Neural Nets ComplexityPeter Skodný. 244-250
- Picture Generation Using Matrix SystemsRalf Stiebe. 251-260
- Representing Heuristic-Relevant Information for an Automated Theorem ProverChristian B. Suttner. 261-270
- A New Method for Proving Lower Bounds in the Model of Algebraic Decision TreesKristel Unger. 271-277
- Area Time Squared and Area Complexity of VLSI Computations is Strongly Unclosed Under Union and IntersectionJuraj Waczulík. 278-287
- Decision Procedure for Checking Validity of PAL FormulasIgor Walukiewicz. 288-298