3. FCT 1981: Szeged, Hungary
- Ferenc Gécseg:
Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981. Lecture Notes in Computer Science 117, Springer 1981, ISBN 3-540-10854-8 - Hajnal Andréka, István Németi:
Some Universal Algebraic and Model Theoretic Results in Computer Science. 16-23 - Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. 24-33 - János Demetrovics, Gyula O. H. Katona:
Extremal Combinatorial Problems in Relational Data Base. 110-119 - Zoltán Ésik:
An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. 130-136 - Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl:
Fast Recognition of Rings and Lattices. 137-145 - H. C. M. Kleijn, Grzegorz Rozenberg:
On the Role of Selectors in Selective Substitution Grammars. 190-198 - Matti Linna:
On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. 244-249 - Friedhelm Meyer auf der Heide, Hans-Anton Rollik:
Random Access Machines and Straight-Line Programs. 259-264 - Detlef Seese:
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. 341-349
Appendix
- Jan Grabowski:
An Algorithm to Identify Slices, with Applications to Vector Replacement Systems. 425-432 - Christoph Meinel:
About the by Codings of Environments Induced Posets [az, <=] and [Lz, <=]. 445-452 - Andrzej Wlodzimierz Mostowski:
The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics. 453-466