Volume 46,
1986
- Christian Mauduit:
Morphismes Unispectraux.
1-11 BibTeX
- Gilles Bernot, Michel Bidoit, Christine Choppy:
Abstract Data Types with Exception Handling: An Initial Approach Based on a Distinction Between Exceptions and Errors.
13-45 BibTeX
- Y. Q. Guo, G. W. Xu, Gabriel Thierrin:
Disjunctive Decomposition of Languages.
47-51 BibTeX
- Kosaburo Hashiguchi:
Notes on Finitely Generated Semigroups and Pumping Conditions for Regular Languages.
53-66 BibTeX
- Nadine Lerat, Witold Lipski Jr.:
Nonapplicable Nulls.
67-82 BibTeX
- Tom Head, Barbara Lando:
Periodic D0L Languages.
83-89 BibTeX
- Hideki Yamasaki, Masako Takahashi, Kojiro Kobayashi:
Characterization of omega-Regular Languages by Monadic Second-Order Formulas.
91-99 BibTeX
- Michel Latteux, Erick Timmerman:
Two Characterizations of Rational Adherences.
101-106 BibTeX
- Rodney R. Howell, Louis E. Rosier, Dung T. Huynh, Hsu-Chun Yen:
Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States.
107-140 BibTeX
- Joxan Jaffar, Peter J. Stuckey:
Semantics of Infinite Tree Logic Programming.
141-158 BibTeX
- Christine Duboc:
On Some Equations in Free Partially Commutative Monoids.
159-174 BibTeX
- Alvis Brazma, Efim B. Kinber:
Generalized Regular Expressions-A Language for Synthesis of Programs with Braching in Loops.
175-195 BibTeX
- Giuseppe Longo, Simone Martini:
Computability in Higher Types, P omega and the Completeness of Type Assignment.
197-217 BibTeX
- Phan Dinh Dieu, Le Cong Thanh, Le Tuan Hoa:
Average Polynomial Time Complexity of Some NP-Complete Problems.
219-327 BibTeX
- Bernhard Griesser:
Lower Bounds for the Approximative Complexity.
329-338 BibTeX
Copyright © Sun May 17 00:23:54 2009
by Michael Ley (ley@uni-trier.de)
