default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th MFCS 1975: Mariánské Lázne, Czechoslovakia
- Jirí Becvár:
Mathematical Foundations of Computer Science 1975, 4th Symposium, Mariánské Lázne, Czechoslovakia, September 1-5, 1975, Proceedings. Lecture Notes in Computer Science 32, Springer 1975, ISBN 0-387-07389-2
Invited Lectures
- Janis Barzdin, Janis Bicevskis, Audris Kalnins:
Construction of Complete Sample System for Correctness Testing. 1-12 - Peter van Emde Boas:
Ten Years of Speedup. 13-29 - Petr Hájek:
On Logics of Discovery. 30-45 - Michael A. Harrison:
On Models of Protection in Operating Systems. 46-60 - Jaroslav Král, Jirí Demner:
Parsing as a Subtask of Compiling. 61-74 - Antoni W. Mazurkiewicz:
Parallel Recursive Program Schemes. 75-87 - Miroslav Novotný:
On Some Problems Concerning Pawlak's Machines. 88-100 - Arto Salomaa:
Formal Power Series and Growth Functions of Lindenmayer Systems. 101-113 - Peter H. Starke:
On the Representability of Relations by Deterministic and Nondeterministic Multi-Tape Automata. 114-124 - Boris A. Trakhtenbrot:
On Problems Solvable by Successive Trials. 125-137 - Vera Trnková:
Automate and Categories. 138-152 - I. D. Zaslavskii:
On Some Models of Computability of Boolean Functions. 153-159
Communications
- Jirí Adámek:
Automata and Categories: Finiteness Contra Minimality. 160-166 - A. V. Anisimov:
Languages Over Free Groups. 167-171 - Giorgio Ausiello, Marco Protasi:
On the Comparison of Notions of Approximation. 172-178 - M. Benesová, Ivan Korec:
Non-Linear Speed-Up Theorem for Two Register Minsky Machines. 179-185 - Eike Best, Hans Albrecht Schmid:
Systems of Open Paths in Petri Nets. 186-193 - Luc Boasson:
on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages. 194-198 - Michal Chytil:
On Complexity of Nondeterministic Turing Machines Computations. 199-205 - Alexander Ja. Dikovsky:
On Closure Properties of Context-Free Derivation Complexity Classes. 206-211 - Venelin K. Evtimov:
Control Structures in Single Block Programs. 212-218 - R. V. Freivald:
Minimal Gödel Numbers and Their Identification in the Limit. 219-225 - Ferenc Gécseg:
Isomorphic Representation of Automata. 226-230 - Hartmann J. Genrich:
Extended Simple Regular Expressions. 231-237 - Giuseppina C. Gini, Maria L. Gini
:
Conniver Programs by Logical Point of View. 238-245 - Jerzy W. Grzymala-Busse:
On the Set of All Automata with the Same Monoid of Endomorphisms. 246-251 - Ivan M. Havel:
Nondterministically Recognizable Sets of Languages. 252-257 - Tomás Havránek:
The Approximation Problem in Computational Statistics. 258-265 - Klaus Indermark:
The Continuous Algebra of Monadic Languages. 266-270 - Max I. Kanovic:
On Sets of Complex-Programmed Numbers. 271-272 - Marek Karpinski:
Decision Algorithms for Havel's Branching Automata. 273-279 - Václav Koubek, Jan Reiterman:
Automata and Categories - Input Processes. 280-286 - Fred Kröger:
Formalization of Algorithmic Reasoning. 287-293 - Giorgio Levi, Franco Sirovich:
Proving Program Properties, Symbolic Evaluation and Logical Procedural Semantics. 294-301 - Jan Maluszynski:
A Contribution to Error Recovery. 302-307 - Otto Mayer:
On the Analysis and Synthesis Problems for Context-Free Expressions. 308-314 - Kurt Mehlhorn, Zvi Galil:
Monotone Switching Circuits and Boolean Matrix Product. 315-319 - Ivan Mezník:
On Some Lattice-Theoretic Properties of Generable Languages. 320-325 - Larisa S. Modina:
On Some Formal Grammars Generating Dependency Trees. 326-329 - Peter A. Ng, Pei Hsia, Raymond T. Yeh:
Graph Walking Automata. 330-336 - Jürgen Perl:
On Finding All Solutions of the Partitioning Problem. 337-343 - Alica Pirická-Kelemenová:
Greibach Normal Form Complexity. 344-350 - Rimma I. Podlovchenko:
On Correctness and Essentiality of Some Ianov Schemas Equivalence Relations. 351-357 - Pavel Pudlák:
Polynomially Complete Problems in the Logic of Automated Discovery. 358-361 - Václav Rajlich:
Relational definition of Computer Languages. 362-376 - Willem P. de Roever:
First-Order Reductions of Call-by-Name to Call-by-Value. 377-398 - Peter Ruzicka:
Local Disambiguating Transformation. 399-404 - Dan A. Simovici:
On Cardinal Sequential Outer Measures. 405-410 - Mark B. Trakhtenbrot:
On Representation of Sequential and Parallel Functions. 411-417 - G. E. Tseytlin:
The Theory of the Modified Post Algebras and Multidimensional Automata Structures. 418-425 - Raymond Turner:
An Algebraic Theory of Formal Languages. 426-431 - Mars K. Valiev:
On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented Groups. 432-438 - Rüdiger Valk:
On the Synthesis of Automata with Several Initial States. 439-444 - Klaus W. Wagner:
A Hierarchy of Regular Sequence Sets. 445-449 - Wolfgang Wechler:
R-Fuzzy Grammars. 450-456 - Gerd Wechsung:
Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes. 457-461 - Rolf Wiehagen:
Inductive Inference of Recursive Functions. 462-464 - Józef Winkowski:
Proving Properties of Programs by Means of Predicate Logic. 465-471 - Boleslaw Wojdylo:
A Generalization of Scott's Flow Diagrams. 472-476
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.
last updated on 2025-11-28 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
