default search action
Bulletin of the EATCS, Volume 39
Volume 39, October 1989
- Joseph A. Goguen:
Momories of ADJ. Bull. EATCS 39: 96-102 (1989) - Hartmut Ehrig, Ingo Claßen:
Overview of Algebraic Specification Languages Environments and Tools, and Algebraic Specifications of Software Systems. Bull. EATCS 39: 103-111 (1989)
- Yuri Gurevich:
Logic in Computer Science Column. Bull. EATCS 39: 112-121 (1989)
- Ronald V. Book, Osamu Watanabe:
A view of structural complexity theory. Bull. EATCS 39: 122-138 (1989)
- Domenico Cantone, Vincenzo Cutello:
Decision procedures for elementary sublanguages of set theory, XVI, Multilevel syllogistic extended by singleton, rank comparison and unary intersection. Bull. EATCS 39: 139-148 (1989) - Maxime Crochemore:
String-matching and periods. Bull. EATCS 39: 149-153 (1989) - Juraj Hromkovic:
The knowledge on information content of problems provides much useful information to circuit designers. Bull. EATCS 39: 154-170 (1989) - Aldo de Luca, Stefano Varricchio:
A positive pumping condition for regular sets. Bull. EATCS 39: 171-174 (1989) - Zoltán Fülöp, Sándor Vágvölgyi:
Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen. Bull. EATCS 39: 175-184 (1989) - Pierre Lescanne:
Well quasi-ordering in a paper by Maurice Janet. Bull. EATCS 39: 185-188 (1989) - Alexander Ollongren:
A curious grammar. Bull. EATCS 39: 189-196 (1989) - Axel Poigné:
Bisimulation as cointersection. Bull. EATCS 39: 197-198 (1989) - Andrzej Skowron:
The evidence theory and decision tables. Bull. EATCS 39: 199-204 (1989) - Friedrich J. Urbanek:
On minimizing finite automata. Bull. EATCS 39: 205-206 (1989)
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.