Volume 35,
1985
- Klaus-Jörn Lange, Emo Welzl:
Recurrent Words and Simultaneous Growth in T0L Systems.
1-15 BibTeX
- Jacques Stern:
Characterizations of Some Classes of Regular Events.
17-42 BibTeX
- Stephen L. Bloom, Douglas R. Troeger:
A Logical Characterization of Observation Equivalence.
43-53 BibTeX
- Herbert Edelsbrunner:
Finding Transversals for Sets of Simple Geometric Figures.
55-69 BibTeX
- Yves Métivier:
Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre.
71-87 BibTeX
- Christophe Benoit:
Axiomatisation des Tests.
89-107 BibTeX
- Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran:
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems.
109-114 BibTeX
- Jean-Pierre Pécuchet:
Automates Boustrophédon et Mots Infinis.
115-122 BibTeX
- Laurent Fribourg:
A Superposition Oriented Theorem Prover.
129-164 BibTeX
- Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
On the Existence of Acyclic Views in a Database Scheme.
165-177 BibTeX
- Robert Cori, Yves Métivier:
Recognizable Subsets of Some Partially Abelian Monoids.
179-189 BibTeX
- Gérard Memmi, Alain Finkel:
An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets.
191-214 BibTeX
- Kojiro Kobayashi:
On Proving Time Constructibility of Functions.
215-225 BibTeX
- Paliath Narendran, Friedrich Otto:
Complexity Results on the Conjugacy Problem for Monoids.
227-243 BibTeX
- David A. Plaisted:
Complete Divisibility Problems for Slowly Utilized Oracles.
245-260 BibTeX
- Sadaki Hirose, Satoshi Okawa, Masaaki Yoneda:
A Homomorphic Characterization of Recursively Enumerable Languages.
261-269 BibTeX
- Jean-Eric Pin, Jacques Sakarovitch:
Une Application de la Representation Matricielle des Transductions.
271-293 BibTeX
- Tom Head, John Wilkinson:
Code Properties and Homomorphisms of D0L Systems.
295-312 BibTeX
- Ernst L. Leiss:
On Classes of Tractable Unrestricted Regular Expressions.
313-327 BibTeX
- Michio Oyamaguchi:
On the Data Type Extension Problem for Algebraic Specifications.
329-336 BibTeX
- Deepak Kapur, Paliath Narendran:
A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System.
337-344 BibTeX
- Ildikó Sain:
A Simple Proof for the Completeness of Floyd's Method.
345-348 BibTeX
Copyright © Wed Jun 4 19:21:05 2008
by Michael Ley (ley@uni-trier.de)
