5. MFCS 1976:
Gdansk,
Poland
Antoni W. Mazurkiewicz (Ed.):
Mathematical Foundations of Computer Science 1976, 5th Symposium, Gdansk, Poland, September 6-10, 1976, Proceedings.
Lecture Notes in Computer Science 45 Springer 1976 BibTeX
@proceedings{DBLP:conf/mfcs/1976,
editor = {Antoni W. Mazurkiewicz},
title = {Mathematical Foundations of Computer Science 1976, 5th Symposium,
Gdansk, Poland, September 6-10, 1976, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {45},
year = {1976},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lecturers
Communications
- Valery N. Agafonov:
On Attribute Grammars.
169-172 BibTeX
- Luigia Carlucci Aiello, Mario Aiello, Giuseppe Attardi, P. Cavallari, Gianfranco Prini:
Formal Definition of Semantics of Generated Control Regimes.
173-179 BibTeX
- E. S. Bainbridge:
Minimal While Programs.
180-186 BibTeX
- Václav Benda, Kamila Bendová:
On Specfic Features of Recognizable Families of Languages.
187-193 BibTeX
- Eberhard Bergmann:
On the Termination of Simple Computer Programs.
194-201 BibTeX
- Gérard Berthelot, Gérard Roucairol:
Reduction of Petri-Nets.
202-209 BibTeX
- Jürgen Brunner, Wolfgang Wechler:
On Behaviour of R-Fuzzy Automata.
210-215 BibTeX
- A. O. Buda:
Cannonizing Reducibility Method in the Theory of Program Schemata.
216-223 BibTeX
- Christian Choffrut:
Strongly Connected G-S-M Mappings Preserving Conjugation.
224-229 BibTeX
- Michal Chytil:
Analysis of the Non-Context-Free Component of Formal Languages.
230-236 BibTeX
- Marco Colombetti, Enrico Pagello:
Programs, Computations and Temporal Features.
237-243 BibTeX
- Wolfgang Coy:
A Note on the Automatic Generation of Inductive Assertions.
244-249 BibTeX
- Armin B. Cremers, Thomas N. Hibbard:
On the Relationship between a Procedure and its Data.
250-254 BibTeX
- Michael I. Dekhtyar:
On the Relativization of Deterministic and Nondeterministic Complexity Classes.
255-259 BibTeX
- Alexandru Dinca:
The Metric Properties on the Semigroups and the Languages.
260-264 BibTeX
- David P. Dobkin, Richard J. Lipton:
A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem.
265-269 BibTeX
- Willibald Dörfler:
The Direct Product of Automata and Quasi-Automata.
270-276 BibTeX
- Hans-Dieter Ehrich:
An Axiomatic Approach to Information Structures.
277-283 BibTeX
- Hartmut Ehrig, Hans-Jörg Kreowski:
Parallelism of Manipulations in Multidimensional Information Structures.
284-293 BibTeX
- Hartmann J. Genrich, Gerda Thieler-Mevissen:
The Calculus of Facts.
588-595 BibTeX
- Seymour Ginsburg, Otto Mayer:
On Strict Interpretations of Grammar Forms.
294-298 BibTeX
- Irina Gorun:
A Hierarchy of Context-Sensitive Languages.
299-303 BibTeX
- Janusz Górski:
On Consecutive Storage of Records.
304-310 BibTeX
- Michal Grabowski:
A Remark on Equivalence of Mazurkiewicz's Finite-Control Algorithms over Nets.
311-316 BibTeX
- I. Hansen, Jacek Leszczylowski:
Microprogram-Oriented Model of the Controlled Structure.
317-322 BibTeX
- M. D. Harrison:
Relations between Programs with Different Storage Requirements.
323-329 BibTeX
- Friedrich W. von Henke:
An Algebraic Approach to Data Types, Program Verification, and Program Synthesis.
330-336 BibTeX
- Matthias Höpner, Manfred Opp:
About Three Equations Classes of Languages Built Up By Shuffle Operations.
337-344 BibTeX
- 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 BibTeX
- Klaus Indermark:
Schemes with Recursion on Higher Types.
352-358 BibTeX
- Jacek Irlik:
Constructing Iterative Version of a System of Recursive Procedures.
359-363 BibTeX
- Walter Issel:
A Method Using a Set-Theoretical Formalism to Describe the Semantics of Programming Languages.
364-371 BibTeX
- Romuald Jagielski:
The Cubic Search Method.
372-376 BibTeX
- Ryszard Janicki:
Vectors of Coroutines.
377-384 BibTeX
- Joanna Jedrzejowicz:
One-One Degrees of Turing Machines Decision Problems.
385-389 BibTeX
- Marek Karpinski:
Multiplicity Functions on Omega-Automata.
596-601 BibTeX
- Jozef Kelemen:
Heuristic Representation of State-Space by Finite Automata.
390-394 BibTeX
- Robert Knast:
Semigroup Characterizations of Some Language Varieties.
395-403 BibTeX
- Antoni Kreczmar:
On Memory Requirements of Strassen's Algorithms.
404-407 BibTeX
- Wlodzimierz Kwasowiec:
Determinism in Concurrent Systems.
408-415 BibTeX
- Kurt Lautenbach, Horst Wedde:
Generating Control Mechanisms by Restrictions.
416-422 BibTeX
- Janusz W. Laski:
On Diagnosis of Algorithmical Processes.
423-429 BibTeX
- Boleslaw Mikolajczak:
On Some Properties of Cyclic Automata and Their Extensions.
430-435 BibTeX
- Grazyna Mirkowska, Andrzej Salwicki:
A Complete Axiomatic Characterization of Algorithmic Properties of Block-Structured Programs with Procedures.
602-606 BibTeX
- Peter D. Mosses:
Compiler Generation Using Denotational Semantics.
436-441 BibTeX
- V. A. Nepomniaschy:
On Divergence Problems for Program Schemas.
442-445 BibTeX
- Anton Nijholt:
On the Parsing of LL-Regular Grammars.
446-452 BibTeX
- Dominique Perrin:
The Characteristic Polynomial of a Finite Automaton.
453-457 BibTeX
- P. Prusinkiewicz:
Error Detection Using Regular Languages.
458-464 BibTeX
- Zbigniew W. Ras:
On a Relationship Between Programs of Address Machines and Mazurkiewicz Algorithms.
465-471 BibTeX
- Willem P. de Roever:
Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination.
472-481 BibTeX
- Grzegorz Rozenberg, Dirk Vermeir:
Context-Free Programmed Grammars and ETOL Systems.
482-487 BibTeX
- Teodor Rus:
Context-Free Algebra: A Mathematical Device for Compiler Specifications.
488-494 BibTeX
- Peter Ruzicka, Juraj Wiedermann:
On the Lower Bound for Minimum Comparison Selection.
495-502 BibTeX
- Andrzej Salwicki, Tomasz Müldner:
Computational Processes Generated by Programs with Recursive Procedures and Block Structures.
503-509 BibTeX
- Jacques Sakarovitch:
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages.
510-516 BibTeX
- Vladimir Yu. Sazonov:
Degrees of Parallelism in Computations.
517-523 BibTeX
- A. Schurmann:
On Adaptability of a System of Programs.
524-529 BibTeX
- Andrzej Skowron:
A Mathematical Model of Parallel Information Processing.
530-536 BibTeX
- Michael B. Smyth:
Powerdomains.
537-543 BibTeX
- Jerzy Tiuryn:
On the Domain of Iteration in Iterative Algebraic Theories.
544-550 BibTeX
- Rutger Verbeek, Klaus Weihrauch:
The Influence of the Data Presentation on the Computational POwer of Machines.
551-558 BibTeX
- Józef Winkowski:
On Sequential Modelling of Non-Sequential Processes.
559-568 BibTeX
- Zbigniew Zwinogrodzki:
Equivalence and Optimization of Recursive Program Schemata.
569-575 BibTeX
Copyright © Sat May 16 23:29:32 2009
by Michael Ley (ley@uni-trier.de)
