16. MFCS 1991: Kazimierz Dolny, Poland

Andrzej Tarlecki (Ed.): Mathematical Foundations of Computer Science 1991, 16th International Symposium, MFCS'91, Kazimierz Dolny, Poland, September 9-13, 1991, Proceedings. Lecture Notes in Computer Science 520 Springer 1991, ISBN 3-540-54345-7 BibTeX

@proceedings{DBLP:conf/mfcs/1991,
  editor    = {Andrzej Tarlecki},
  title     = {Mathematical Foundations of Computer Science 1991, 16th International
               Symposium, MFCS'91, Kazimierz Dolny, Poland, September 9-13,
               1991, Proceedings},
  booktitle = {MFCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {520},
  year      = {1991},
  isbn      = {3-540-54345-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

Jean-Louis Lassez, Michael J. Maher, Kim Marriott: Elimination of Negation in Term Algebras. 1-16 BibTeX
Pierre Lescanne: Rewrite Orderings and Termination of Rewrite Systems. 17-27 BibTeX
Zohar Manna, Amir Pnueli: On the Faithfulness of Formal Models. 28-42 BibTeX
Mogens Nielsen: Models for Concurrency. 43-46 BibTeX
Andrzej Salwicki: On a Hierarchy of File Types and a Tower of Their Theories. 47-63 BibTeX

Contributions

Fabio Alessi, Franco Barbanera: Strong Conjunction and Intersection Types. 64-73 BibTeX
Egidio Astesiano, Maura Cerioli: Partial Higher-Order Specifications. 74-83 BibTeX
Staffan Bonnier: Unification in Incompletely Specified Theories: A Case Study. 84-92 BibTeX
Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: Observing Localities (Extended Abstract). 93-102 BibTeX
Gerardo Costa, Gianna Reggio: Abstract Dynamic Data Types: A Temporal Logic Approach. 103-112 BibTeX
Anton Cerný: Generating Words by Cellular Automata. 113-120 BibTeX
Pierpaolo Degano, Roberto Gorrieri: Atomic Refinement in Process Description Languages. 121-130 BibTeX
Volker Diekert, Paul Gastin, Antoine Petit: Recognizable Complex Trace Languages. 131-140 BibTeX
Eric Domenjoud: Solving Systems of Linear Diophantine Equations: An Algebraic Approach. 141-150 BibTeX
Gilles Dowek: A Second-Order Pattern Matching Algorithm for the Cube of Typed Lambda-Calculi. 151-160 BibTeX
Lavinia Egidi, Furio Honsell, Simona Ronchi Della Rocca: The lazy call-by-value Lamda-Calculus. 161-169 BibTeX
Roberto Gorrieri, Cosimo Laneve: The Limit of Split_n-Bisimulations for CCS Agents. 170-180 BibTeX
Georges Hansel, Daniel Krob, Christian Michaux: Stochastic Automata and Length Distributions of Rational Languages. 181-190 BibTeX
Barney P. Hilken, David E. Rydeheard: Towards a Categorical Semantics Type Classes. 191-201 BibTeX
Rodney R. Howell, Petr Jancar, Louis E. Rosier: Single-Path Petri Nets. 202-210 BibTeX
Juraj Hromkovic, Burkhard Monien: The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). 211-220 BibTeX
Oscar H. Ibarra, Tao Jiang, Hui Wang: Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata. 221-230 BibTeX
Paola Inverardi, Monica Nesi: Infinite Normal Forms for Non-Linear Term Rewriting Systems. 231-239 BibTeX
Petteri Jokinen, Esko Ukkonen: Two Algorithms for Approximate String Matching in Static Texts. 240-248 BibTeX
Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek: Efficient Constructions of Test Sets for Regular and Context-Free Languages. 249-258 BibTeX
Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis: The Complexity of The Reliable Connectivity Problem. 259-266 BibTeX
Delia Kesner: Pattern Matching in Order-Sorted Languages. 267-276 BibTeX
Beata Konikowska: Two Over Three: A Two-Valued Logic for Software Specification and Validation Over a Three-Valued Predicate Calculus. 277-286 BibTeX
Emmanuel Kounalis, Denis Lugiez, Loic Pottier: A Solution of the Complement Problem in Associative-Commutative Theories. 287-297 BibTeX
Padmanabhan Krishnan: A Model for Real-Time Systems. 298-307 BibTeX
Nguyen Huong Lam, Do Long Van: On Strict Codes. 308-317 BibTeX
Hans Leiß, Fritz Henglein: A Decidable Case of the Semi-Unification Problem. 318-327 BibTeX
Claudia Leopold: Maintaining Dictionaries in a Hierarchical Memory. 328-336 BibTeX
Christoph Meinel, Stephan Waack: Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. 337-345 BibTeX
Ugo Montanari, Vladimiro Sassone: CCS Dynamic Bisimulation is Progressing. 346-356 BibTeX
M. A. Nait Abdallah: Syntax and Semantics of a Monotonic Framework for Non-Monotonic Reasoning. 357-366 BibTeX
Damian Niwinski: On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. 367-376 BibTeX
Barbara Paech: Extending Temporal Logic by Explicit Concurrency. 377-386 BibTeX
Ramón Pino Pérez: An Extensional Partial Combinatory Algebra Based on Lamda-Terms. 387-396 BibTeX
Axel Poigné: Once More on Order-Sorted Algebras. 397-405 BibTeX
Yves Roos, Pierre-André Wacrenier: Composition of Two Semi Commutations. 406-414 BibTeX
Peter Ruzicka: An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. 415-425 BibTeX
Konstantin V. Shvachko: Different Modifications of Pointer Machines and Their Computational Power. 426-435 BibTeX