default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. MFCS 1976: Gdansk, Poland
- Antoni W. Mazurkiewicz:
Mathematical Foundations of Computer Science 1976, 5th Symposium, Gdansk, Poland, September 6-10, 1976, Proceedings. Lecture Notes in Computer Science 45, Springer 1976, ISBN 0-387-07854-1
Invited Lecturers
- Krzysztof R. Apt, J. W. de Bakker:
Exercises in Denotational Semantics. 1-11 - Wilfried Brauer:
W-Automata and Their Languages. 12-22 - Jean-Marc Cadiou:
On Semantic Issues in the Relational Model of Data. 23-38 - Edsger W. Dijkstra:
The Effective Arrangement of Logical Systems. 39-51 - Giorgio Germano, Andrea Maggiolo-Schettini:
Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs. 52-64 - Jozef Gruska:
Descriptional Complexity (of Languages) - A Short Survey. 65-80 - Ivan M. Havel:
On the Branching Structure of Languages. 81-98 - V. Giarratana, F. Gimona, Ugo Montanari:
Observability Concepts in Abstract Data Type Specifications. 576-587 - N. M. Nagorny:
Algorithms and Real Numbers. 99-104 - Miroslav Novotný:
On Mappings of Machines. 105-114 - Arto Salomaa:
Recent Results on L Systems. 115-123 - Peter H. Starke:
Decision Problems for Multi-Tape Automata. 124-136 - Boris A. Trakhtenbrot:
Recursive Program Schemas and Computable Functionals. 137-152 - Eric G. Wagner, Jesse B. Wright, Joseph A. Goguen, James W. Thatcher:
Some Fundamentals of Order-Algebraic Semantics. 153-168
Communications
- Valery N. Agafonov:
On Attribute Grammars. 169-172 - Luigia Carlucci Aiello, Mario Aiello, Giuseppe Attardi, P. Cavallari, Gianfranco Prini:
Formal Definition of Semantics of Generated Control Regimes. 173-179 - E. S. Bainbridge:
Minimal While Programs. 180-186 - Václav Benda, Kamila Bendová:
On Specfic Features of Recognizable Families of Languages. 187-193 - Eberhard Bergmann:
On the Termination of Simple Computer Programs. 194-201 - Gérard Berthelot, Gérard Roucairol:
Reduction of Petri-Nets. 202-209 - Jürgen Brunner, Wolfgang Wechler:
On Behaviour of R-Fuzzy Automata. 210-215 - Anatoliy O. Buda:
Cannonizing Reducibility Method in the Theory of Program Schemata. 216-223 - Christian Choffrut:
Strongly Connected G-S-M Mappings Preserving Conjugation. 224-229 - Michal Chytil:
Analysis of the Non-Context-Free Component of Formal Languages. 230-236 - Marco Colombetti, Enrico Pagello
:
Programs, Computations and Temporal Features. 237-243 - Wolfgang Coy:
A Note on the Automatic Generation of Inductive Assertions. 244-249 - Armin B. Cremers, Thomas N. Hibbard:
On the Relationship between a Procedure and its Data. 250-254 - Michael I. Dekhtyar:
On the Relativization of Deterministic and Nondeterministic Complexity Classes. 255-259 - Alexandru Dinca:
The Metric Properties on the Semigroups and the Languages. 260-264 - David P. Dobkin, Richard J. Lipton:
A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. 265-269 - Willibald Dörfler:
The Direct Product of Automata and Quasi-Automata. 270-276 - Hans-Dieter Ehrich:
An Axiomatic Approach to Information Structures. 277-283 - Hartmut Ehrig, Hans-Jörg Kreowski:
Parallelism of Manipulations in Multidimensional Information Structures. 284-293 - Hartmann J. Genrich, Gerda Thieler-Mevissen:
The Calculus of Facts. 588-595 - Seymour Ginsburg, Otto Mayer:
On Strict Interpretations of Grammar Forms. 294-298 - Irina Gorun:
A Hierarchy of Context-Sensitive Languages. 299-303 - Janusz Górski:
On Consecutive Storage of Records. 304-310 - Michal Grabowski:
A Remark on Equivalence of Mazurkiewicz's Finite-Control Algorithms over Nets. 311-316 - Igor Hansen, Jacek Leszczylowski:
Microprogram-Oriented Model of the Controlled Structure. 317-322 - Michael D. Harrison:
Relations between Programs with Different Storage Requirements. 323-329 - Friedrich W. von Henke:
An Algebraic Approach to Data Types, Program Verification, and Program Synthesis. 330-336 - Matthias Höpner, Manfred Opp:
About Three Equations Classes of Languages Built Up By Shuffle Operations. 337-344 - Hagen Huwig:
A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time Bounds. 345-351 - Klaus Indermark:
Schemes with Recursion on Higher Types. 352-358 - Jacek Irlik:
Constructing Iterative Version of a System of Recursive Procedures. 359-363 - Walter Issel:
A Method Using a Set-Theoretical Formalism to Describe the Semantics of Programming Languages. 364-371 - Romuald Jagielski:
The Cubic Search Method. 372-376 - Ryszard Janicki:
Vectors of Coroutines. 377-384 - Joanna Jedrzejowicz:
One-One Degrees of Turing Machines Decision Problems. 385-389 - Marek Karpinski:
Multiplicity Functions on Omega-Automata. 596-601 - Jozef Kelemen:
Heuristic Representation of State-Space by Finite Automata. 390-394 - Robert Knast:
Semigroup Characterizations of Some Language Varieties. 395-403 - Antoni Kreczmar:
On Memory Requirements of Strassen's Algorithms. 404-407 - Wlodzimierz Kwasowiec:
Determinism in Concurrent Systems. 408-415 - Kurt Lautenbach, Horst F. Wedde:
Generating Control Mechanisms by Restrictions. 416-422 - Janusz W. Laski:
On Diagnosis of Algorithmical Processes. 423-429 - Boleslaw Mikolajczak:
On Some Properties of Cyclic Automata and Their Extensions. 430-435 - Grazyna Mirkowska, Andrzej Salwicki:
A Complete Axiomatic Characterization of Algorithmic Properties of Block-Structured Programs with Procedures. 602-606 - Peter D. Mosses:
Compiler Generation Using Denotational Semantics. 436-441 - Valery A. Nepomniaschy:
On Divergence Problems for Program Schemas. 442-445 - Anton Nijholt:
On the Parsing of LL-Regular Grammars. 446-452 - Dominique Perrin:
The Characteristic Polynomial of a Finite Automaton. 453-457 - P. Prusinkiewicz:
Error Detection Using Regular Languages. 458-464 - Zbigniew W. Ras:
On a Relationship Between Programs of Address Machines and Mazurkiewicz Algorithms. 465-471 - Willem P. de Roever:
Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination. 472-481 - Grzegorz Rozenberg, Dirk Vermeir:
Context-Free Programmed Grammars and ETOL Systems. 482-487 - Teodor Rus:
Context-Free Algebra: A Mathematical Device for Compiler Specifications. 488-494 - Peter Ruzicka, Juraj Wiedermann:
On the Lower Bound for Minimum Comparison Selection. 495-502 - Andrzej Salwicki, Tomasz Müldner:
Computational Processes Generated by Programs with Recursive Procedures and Block Structures. 503-509 - Jacques Sakarovitch:
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. 510-516 - Vladimir Yu. Sazonov:
Degrees of Parallelism in Computations. 517-523 - A. Schurmann:
On Adaptability of a System of Programs. 524-529 - Andrzej Skowron:
A Mathematical Model of Parallel Information Processing. 530-536 - Michael B. Smyth:
Powerdomains. 537-543 - Jerzy Tiuryn:
On the Domain of Iteration in Iterative Algebraic Theories. 544-550 - Rutger Verbeek, Klaus Weihrauch:
The Influence of the Data Presentation on the Computational POwer of Machines. 551-558 - Józef Winkowski:
On Sequential Modelling of Non-Sequential Processes. 559-568 - Zbigniew Zwinogrodzki:
Equivalence and Optimization of Recursive Program Schemata. 569-575
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 2024-11-15 19:19 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:
