Informatique Théorique et Applications
, Volume 27, 1993
Volume 27, Number 1, 1993
John Higgins
,
Douglas M. Campbell
: Prescribed Ultrametrics. 1-5
BibTeX
Andrzej Ehrenfeucht
,
Hendrik Jan Hoogeboom
,
Grzegorz Rozenberg
: On the Structure of Recognizable Languages of Dependence Graphs. 7-22
BibTeX
Didier Caucal
: A Fast Algorithm to Decide on the Equivalence of Stateless DPDA. 23-48
BibTeX
Franz-Josef Brandenburg
,
Jürgen Dassow
: Efficient Reductions of Picture Words. 49-56
BibTeX
Alexandru Mateescu
,
Arto Salomaa
: PCP-Prime Words and Primality Types. 57-70
BibTeX
Victor Mitrana
: On Languages Satisfying ``Interchange Lemma''. 71-79
BibTeX
Volume 27, Number 2, 1993
George K. Georgakopoulos
,
Andreas Stafylopatis
: An Approach to Parallel Algorithm Design. 85-95
BibTeX
Véronique Terrier
: Real Time Recognition with Cellular Automata: A Meaningful Example. 97-120
BibTeX
Philippe H. Glesser
: Majoration de la norme des facteurs d'un polynôme: cas où toutes les racines du polynôme sont réelles. 121-134
BibTeX
Alberto Bertoni
,
Massimiliano Goldwurm
: On Ranking 1-Way Finitely Ambiguous NL Languages and #P
1
-Complete Census Functions. 135-148
BibTeX
Paolo Massazza
: Holonomic Functions and Their Relation to Linearly Constrained Languages. 149-161
BibTeX
M. Ph. Saux Picart
: On Searching for Roots of a Polynomial in a Circular Annulus. 162-172
BibTeX
Volume 27, Number 3, 1993
Michele Angelaccio
,
Marco Protasi
: Limiting Characterizations of Low Level Space Complexity Classes. 175-182
BibTeX
Joachim Biskup
,
Pratul Dublish
: Objects in Relational Database Schemes with Functional Inclusion, and Exclusion Dependencies. 183-219
BibTeX
Erik Poll
,
C. Hemerik
,
Huub M. M. ten Eikelder
: CPO-Models for Second Order Lambda Calculus with Recursive Types and Subtyping. 221-260
BibTeX
Helen Cameron
,
Derick Wood
: Pm Numbers, Ambiguity, and Regularity. 261-275
BibTeX
Volume 27, Number 4, 1993
V. Diciunas
: On the Positive and the Inversion Complexity of Boolean Functions. 283-293
BibTeX
Jyrki Katajainen
,
Christos Levcopoulos
,
Ola Petersson
: Space-Efficient Parallel Merging. 295-310
BibTeX
A. Rudnicki
: An Economical Transformation of Graph Grammars. 311-325
BibTeX
Andreas Flögel
,
Hans Kleine Büning
,
Theodor Lettmann
: On the Restricted Equivalence Subclasses of Propositional Logic. 327-340
BibTeX
Jean Marcel Pallo
: An Algorithm to Compute the Möbius Function of the Rotation Lattice of Binary Trees. 341-348
BibTeX
Viliam Geffert
: Sublogarithmic Sigma
2
-Space is not Closed under Complement and Other Separation Results. 349-366
BibTeX
Foto N. Afrati
,
Andreas Stafylopatis
: Performance Considerations on a Random Graph Model for Parallel Processing. 367-388
BibTeX
Volume 27, Number 5, 1993
Krzysztof Diks
,
Andrzej Pelc
: Fast Diagnosis of Multiprocessor Systems with Random Faults. 391-401
BibTeX
Meena Mahajan
,
Kamala Krithivasan
: Language Classes Defined by Time-Bounded Relativised Cellular Automata. 403-432
BibTeX
Andrzej Ehrenfeucht
,
Paulien ten Pas
,
Grzegorz Rozenberg
: Combinatorial Properties of Texts. 433-464
BibTeX
A. Bel Hala
: Congestion optimale du plongement de l'hypercube
H(n)
dans la chaîne
P
(2
n
). 465-481
BibTeX
Volume 27, Number 6, 1993
Gianfranco Mascari
,
F. Pucci
: Autonomous Posets and Quantales. 483-501
BibTeX
Wafaa Khalil
,
Robert F. C. Walters
: An Imperative Language Based on Distributive Categories II. 503-522
BibTeX
Mikael Rittri
: Retrieving Library Functions by Unifying Types Modulo Linear Isomorphism. 523-540
BibTeX
Uwe Trier
: On the Average Number of Registers Needed to Evaluate a Special Class of Backtrack Trees. 541-554
BibTeX
Anne Bergeron
: A Unified Approach to Control Problems in Discrete Event Processes. 555-573
BibTeX
Copyright ©
Sun May 17 00:04:54 2009 by
Michael Ley
(
ley@uni-trier.de
)