11. FCT 1997:
: Stochastic Analysis of Dynamic Processes.
Anna E. Frid
: The Subword Complexity of Fixed Points of Binary Uniform Morphisms.
: Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria.
, Ernst W. Mayr
: The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups.
: A Two-Dimensional Hierarchy for Attributed Tree Transducers.
: Cellular Automata Universality Revisited.
Markus E. Nebel
: On the Average Complexity of the Membership Problem for a Generalized Dyck Language.
: The Equivalence of Pebbles and Sensing Heads for Finite Automata.
: On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP.
Rakesh M. Verma
: Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps.