Theoretical Computer Science, Volume 72

Volume 72, Number 1, 1990

• Lothar Budach: Topological Invariants of Classification Problems. 3-26 BibTeX
• Kosaburo Hashiguchi: Improved Limitedness Theorems on Finite Automata with Distance Functions. 27-38 BibTeX
• Arturo Carpi, Aldo de Luca: Non-Repetitive Words Relative to a Rewriting System. 39-53 BibTeX
• Antonio Restivo: Codes and Local Constraints. 55-64 BibTeX
• Imre Simon: Factorization Forests of Finite Height. 65-94 BibTeX

Volume 72, Number 2&3, 1990

• Giorgio Ausiello, Umberto Nanni: Dynamic Maintenance of Directed Hypergraphs. 97-117 BibTeX
• Erwin Engeler: Combinatory Differential Fields. 119-131 BibTeX
• Rachid Echahed: On Completeness of Narrowing Strategies. 133-146 BibTeX
• Jean Françon, B. Randrianarimanana, René Schott: Analysis of Dynamic Algorithms in Knuth's Model. 147-167 BibTeX
• Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner: Equational Completion in Order-Sorted Algebras. 169-202 BibTeX
• Roberto Gorrieri, Sergio Marchetti, Ugo Montanari: A2CCKS: Atomic Actions for CCS. 203-223 BibTeX
• Richard Kennaway: Implementing Term Rewrite Languages in Dactl. 225-249 BibTeX
• Rolf Klein, Derick Wood: A Tight Upper Bound for the Path Length of AVL Trees. 251-264 BibTeX
• Kim Guldstrand Larsen: Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion. 265-288 BibTeX