Contents of Fundamenta Informaticae
Volume 30.
Number
1 , April 1997- Number
2, May 1997
Contents of Volume 30,
Number 1, April 1997
Click on title for abstract
- Asking Questions Versus Verifability
- W. GASARCH and M. VELAUTHAPILLAI
- On the Decidability of Non-Interleaving
Process Equivalences
- A. KIEHN and M. HENNESSY
- Some Undecidability Results for
Finitely Generated Thue Congruences on a Two-Letter Alphabet
- K. MANDLENER and F. OTTO
- Controlled H Systems and Chomsky
Hierarchy
- G. PAUN
- Tree Automata and Automated Model
Building
- N. PELTIER
- On The Power of Compositional
Proofs for Nets: Relatioships Between Completness and Modularity
- B. A. TRAKHTENBROT
- A Representation of Processes
of Petri Nets by Matrices
- J. WINKOWSKI
- Deriving Invariants and Constraints
form Action Theories
- Y. ZHANG and N. Y. FOO
Contents of Volume 30, Number 2, May1997
Click on title for abstract
- Directions and Foldings on Generalized
Trees
- S. A. BASARAB
- Some Techniques of Reducing the
Dangers of Combinatorial Explosion in Automatic Knowledge Acquisition
- N. V. FINDLER
- On the Computational Complexity
of Marcus Contextual Languages
- L. ILIE
- On Generalized Ajdukiewicz and
Lambek Calculi and Grammars
- M. KANDULSKI
- Pattern Ambiguities for Pure
Context-Free Grammars
- E. MAKINEN and F. L. TIPLEA
- Double-Pushout Hypergraph Rewriting
Using Total Conformisms
- M. LLABRES and F. ROSSELLO
-