| 1981 | A Definition of the P=NP-Problem in Categories. Hagen Huwig |
| 1981 | A New Operation Between Languages. Joffroy Beauquier |
| 1981 | About the by Codings of Environments Induced Posets [a Christoph Meinel |
| 1981 | An Algebraic Defenition of Attributed Transformations. Miklós Bartha |
| 1981 | An Algorithm to Identify Slices, with Applications to Vector Replacement Systems. Jan Grabowski |
| 1981 | An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. Zoltán Ésik |
| 1981 | Analogies of PAL and COPY. Franz-Josef Brandenburg |
| 1981 | Classes of Functions over Binary Trees. Hans Kleine Büning |
| 1981 | Co-Algebras as Machines for the Interpretations of Flow Diagrams. Wolfgang Merzenich |
| 1981 | Context-Free Languages of Infinite Words As Least Fixpoints. Axel Poigné |
| 1981 | Dynamic Algebras of Programs. István Németi |
| 1981 | Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. Detlef Seese |
| 1981 | Equality Languages and Language Families. Jürgen Dassow |
| 1981 | Extensions of Symmetric Hom-Functors to the Kleisli Category. Jirí Vinárek |
| 1981 | Extremal Combinatorial Problems in Relational Data Base. János Demetrovics, Gyula O. H. Katona |
| 1981 | Fast Recognition of Rings and Lattices. Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl |
| 1981 | First Order Dynamic Logic with Decidable Proofs and Workable Model Theory. Ildikó Sain |
| 1981 | Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981 Ferenc Gécseg |
| 1981 | Generating Graph Languages Using Hypergraph Grammars. Dirk Janssens, Grzegorz Rozenberg |
| 1981 | Homogenity and Completeness. B. Csákány |
| 1981 | Isomorphism Completeness for Some Algebraic Structures. Ludek Kucera, Vera Trnková |
| 1981 | Logical Description of Computation Processes. Egon Börger |
| 1981 | Lower Bounds for Problems Defined by Polynomial Inequalities. Jerzy W. Jaromczyk |
| 1981 | Mathematical Structures Underlying Greedy Algorithms. Bernhard Korte, László Lovász |
| 1981 | Moderately Exponential Bound for Graph Isomorphism. László Babai |
| 1981 | Observability and Nerode Equivalence in Concrete C5ategories. Jirí Adámek |
| 1981 | On Cellular Graph-Automata and Second-Order Definable Graph-Properties. György Turán |
| 1981 | On Strongly Cube-Free Omega-Words Generated by Binary Morphisms. Juhani Karhumäki |
| 1981 | On Subwords of Formal Languages. Grzegorz Rozenberg |
| 1981 | On the Error Correcting Power of Pluralism in Inductive Inference. Robert P. Daley |
| 1981 | On the LBA Problem. Burkhard Monien |
| 1981 | On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. Matti Linna |
| 1981 | On the Role of Selectors in Selective Substitution Grammars. H. C. M. Kleijn, Grzegorz Rozenberg |
| 1981 | On the Size of Conjunctive Representations of n-ary Relations. Ales Pultr |
| 1981 | One Pebble Does Not Suffice to Search Plane Labyrinths. Frank Hoffmann |
| 1981 | Pebbling and Bandwith. Ivan Hal Sudborough |
| 1981 | Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi |
| 1981 | Processes in Petri Nets. Peter H. Starke |
| 1981 | Quasi-Equational Logic for Partial Algebras. Peter Burmeister |
| 1981 | Random Access Machines and Straight-Line Programs. Friedhelm Meyer auf der Heide, Hans-Anton Rollik |
| 1981 | Rational Cone and Substitution. Jeannine Leguy |
| 1981 | Reducing Algebraic Tree Grammars. Bernard Leguy |
| 1981 | Remarks on the Notion of Concurrency Relation in the Case of Systems. Piotr W. Prószynski |
| 1981 | Some Algebraic Aspects of Recognizability and Rationality. Magnus Steinby |
| 1981 | Some Properties of Language Families Generated by Commutative Languages. Juha Kortelainen |
| 1981 | Some Universal Algebraic and Model Theoretic Results in Computer Science. Hajnal Andréka, István Németi |
| 1981 | Specifying Algebraic Data Types by Domain Equations. Hans-Dieter Ehrich |
| 1981 | Tape Complexity of Word Problems. Stephan Waack |
| 1981 | The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics. Andrzej Wlodzimierz Mostowski |
| 1981 | The Equivalence Problem for LL- and LR-Regular Grammars. Anton Nijholt |
| 1981 | What is Computable for Abstract Data Types? Heinz Kaphengst |