| 1975 | A Contribution to Error Recovery. Jan Maluszynski |
| 1975 | A Generalization of Scott's Flow Diagrams. Boleslaw Wojdylo |
| 1975 | A Hierarchy of Regular Sequence Sets. Klaus W. Wagner |
| 1975 | An Algebraic Theory of Formal Languages. Raymond Turner |
| 1975 | Automata and Categories - Input Processes. Václav Koubek, Jan Reiterman |
| 1975 | Automata and Categories: Finiteness Contra Minimality. Jirí Adámek |
| 1975 | Automate and Categories. Vera Trnková |
| 1975 | Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes. Gerd Wechsung |
| 1975 | Conniver Programs by Logical Point of View. Giuseppina C. Gini, Maria L. Gini |
| 1975 | Construction of Complete Sample System for Correctness Testing. Janis Barzdin, Janis Bicevskis, Audris Kalnins |
| 1975 | Control Structures in Single Block Programs. Venelin K. Evtimov |
| 1975 | Decision Algorithms for Havel's Branching Automata. Marek Karpinski |
| 1975 | Extended Simple Regular Expressions. Hartmann J. Genrich |
| 1975 | First-Order Reductions of Call-by-Name to Call-by-Value. Willem P. de Roever |
| 1975 | Formal Power Series and Growth Functions of Lindenmayer Systems. Arto Salomaa |
| 1975 | Formalization of Algorithmic Reasoning. Fred Kröger |
| 1975 | Graph Walking Automata. Peter A. Ng, Pei Hsia, Raymond T. Yeh |
| 1975 | Greibach Normal Form Complexity. Alica Pirická-Kelemenová |
| 1975 | Inductive Inference of Recursive Functions. Rolf Wiehagen |
| 1975 | Isomorphic Representation of Automata. Ferenc Gécseg |
| 1975 | Languages Over Free Groups. A. V. Anisimov |
| 1975 | Local Disambiguating Transformation. Peter Ruzicka |
| 1975 | Mathematical Foundations of Computer Science 1975, 4th Symposium, Mariánské Lázne, Czechoslovakia, September 1-5, 1975, Proceedings Jirí Becvár |
| 1975 | Minimal Gödel Numbers and Their Identification in the Limit. R. V. Freivald |
| 1975 | Monotone Switching Circuits and Boolean Matrix Product. Kurt Mehlhorn, Zvi Galil |
| 1975 | Non-Linear Speed-Up Theorem for Two Register Minsky Machines. M. Benesová, Ivan Korec |
| 1975 | Nondterministically Recognizable Sets of Languages. Ivan M. Havel |
| 1975 | On Cardinal Sequential Outer Measures. Dan A. Simovici |
| 1975 | On Closure Properties of Context-Free Derivation Complexity Classes. Alexander Ja. Dikovsky |
| 1975 | On Complexity of Nondeterministic Turing Machines Computations. Michal Chytil |
| 1975 | On Correctness and Essentiality of Some Ianov Schemas Equivalence Relations. Rimma I. Podlovchenko |
| 1975 | On Finding All Solutions of the Partitioning Problem. Jürgen Perl |
| 1975 | On Logics of Discovery. Petr Hájek |
| 1975 | On Models of Protection in Operating Systems. Michael A. Harrison |
| 1975 | On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented Groups. Mars K. Valiev |
| 1975 | On Problems Solvable by Successive Trials. Boris A. Trakhtenbrot |
| 1975 | On Representation of Sequential and Parallel Functions. Mark B. Trakhtenbrot |
| 1975 | On Sets of Complex-Programmed Numbers. Max I. Kanovic |
| 1975 | On Some Formal Grammars Generating Dependency Trees. Larisa S. Modina |
| 1975 | On Some Lattice-Theoretic Properties of Generable Languages. Ivan Mezník |
| 1975 | On Some Models of Computability of Boolean Functions. I. D. Zaslavskii |
| 1975 | On Some Problems Concerning Pawlak's Machines. Miroslav Novotný |
| 1975 | On the Analysis and Synthesis Problems for Context-Free Expressions. Otto Mayer |
| 1975 | On the Comparison of Notions of Approximation. Giorgio Ausiello, Marco Protasi |
| 1975 | On the Representability of Relations by Deterministic and Nondeterministic Multi-Tape Automata. Peter H. Starke |
| 1975 | On the Set of All Automata with the Same Monoid of Endomorphisms. Jerzy W. Grzymala-Busse |
| 1975 | On the Synthesis of Automata with Several Initial States. Rüdiger Valk |
| 1975 | Parallel Recursive Program Schemes. Antoni W. Mazurkiewicz |
| 1975 | Parsing as a Subtask of Compiling. Jaroslav Král, Jirí Demner |
| 1975 | Polynomially Complete Problems in the Logic of Automated Discovery. Pavel Pudlák |
| 1975 | Proving Program Properties, Symbolic Evaluation and Logical Procedural Semantics. Giorgio Levi, Franco Sirovich |
| 1975 | Proving Properties of Programs by Means of Predicate Logic. Józef Winkowski |
| 1975 | R-Fuzzy Grammars. Wolfgang Wechler |
| 1975 | Relational definition of Computer Languages. Václav Rajlich |
| 1975 | Systems of Open Paths in Petri Nets. Eike Best, Hans Albrecht Schmid |
| 1975 | Ten Years of Speedup. Peter van Emde Boas |
| 1975 | The Approximation Problem in Computational Statistics. Tomás Havránek |
| 1975 | The Continuous Algebra of Monadic Languages. Klaus Indermark |
| 1975 | The Theory of the Modified Post Algebras and Multidimensional Automata Structures. G. E. Tseytlin |
| 1975 | on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages. Luc Boasson |