


default search action
Theoretical Computer Science, Volume 72
Volume 72, Number 1, 1990
- Lothar Budach:

Topological Invariants of Classification Problems. 3-26 - Kosaburo Hashiguchi:

Improved Limitedness Theorems on Finite Automata with Distance Functions. 27-38 - Arturo Carpi, Aldo de Luca:

Non-Repetitive Words Relative to a Rewriting System. 39-53 - Antonio Restivo:

Codes and Local Constraints. 55-64 - Imre Simon:

Factorization Forests of Finite Height. 65-94
Volume 72, Number 2&3, 1990
- Giorgio Ausiello, Umberto Nanni

:
Dynamic Maintenance of Directed Hypergraphs. 97-117 - Erwin Engeler:

Combinatory Differential Fields. 119-131 - Rachid Echahed:

On Completeness of Narrowing Strategies. 133-146 - Jean Françon, B. Randrianarimanana, René Schott:

Analysis of Dynamic Algorithms in Knuth's Model. 147-167 - Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner:

Equational Completion in Order-Sorted Algebras. 169-202 - Roberto Gorrieri, Sergio Marchetti, Ugo Montanari:

A2CCKS: Atomic Actions for CCS. 203-223 - Richard Kennaway

:
Implementing Term Rewrite Languages in Dactl. 225-249 - Rolf Klein, Derick Wood:

A Tight Upper Bound for the Path Length of AVL Trees. 251-264 - Kim Guldstrand Larsen:

Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion. 265-288

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














