Fundamenta Informaticae, Volume 36

Volume 36, Number 1, September 1998

Girish Bhat, Doron Peled:
Adding Partial Orders to Linear Temporal Logic. 1-21
Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
General Domain Circumscription and its Effective Reductions. 23-55
George Rahonis, Kai Salomaa:
On the Size of Stack and Synchronization Alphabets of Tree Automata. 57-69
Józef Winkowski:
Processes of Contextual Nets and their Characteristics. 71-101

Mohamed Amin:
Remarks on the Relationship Between Cooperating Distributed Grammar Systems and Lindenmayer Systems. 103-107
Anastasia Analyti, Nicolas Spyratos, Panos Constantopoulos:
On the Semantics of a Semantic Network. 109-144
Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin:
Characterization of the Expressive Power of Silent Transitions in Timed Automata. 145-182
Jürgen Dassow, Gheorghe Paun:
Remarks on Operations Suggested by Mutations in Genomes. 183-200
Agostino Dovier, Alberto Policriti, Gianfranco Rossi:
A Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms. 201-234
C. A. Middelburg:
Truth of Duration Calculus Formulae in Timed Frames. 235-263
Jaroslaw Stepaniuk:
Optimizations of Rough Set Model. 265-283
Larissa Zhiltsova:
On Entropy and Optimal Coding Cost for Stochastic Language. 285-305

Dima Burago, Michel de Rougemont:
On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions. 307-315
Zbigniew J. Czech, Wojciech Mikanik:
Randomized PRAM Simulation. 317-336
Jan Ostravsky:
Pregrammars Versus Submonoids. 337-343
Wladyslaw Skarbek, Adam Pietrowcew, Radoslaw Sikora:
The Modified Oja-RLS Algorithm, Stochastic Convergence Analysis and Application for Image Compression. 345-365
Sándor Vágvölgyi:
Simple and Minimal Ground Term Equation Systems. 367-413

Last update Fri May 24 20:20:34 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page