Mathematical Foundations of Computer Science 1991 de Andrzej Tarlecki

Mathematical Foundations of Computer Science 1991: 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings: Lecture Notes in Computer Science, cartea 520

Andrzej Tarlecki

This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

15%

Preț: 551^.42 lei
20%

Preț: 323^.34 lei
20%

Preț: 324^.90 lei
20%

Preț: 315^.78 lei
20%

Preț: 238^.01 lei
20%

Preț: 1021^.21 lei
20%

Preț: 323^.34 lei
20%

Preț: 438^.69 lei
20%

Preț: 315^.19 lei
20%

Preț: 326^.49 lei
20%

Preț: 148^.66 lei
20%

Preț: 310^.26 lei
20%

Preț: 612^.93 lei
20%

Preț: 1008^.19 lei
20%

Preț: 556^.53 lei
17%

Preț: 360^.19 lei
20%

Preț: 622^.19 lei
20%

Preț: 307^.71 lei
20%

Preț: 1123^.66 lei
20%

Preț: 561^.88 lei
20%

Preț: 972^.97 lei
20%

Preț: 320^.21 lei
20%

Preț: 256^.27 lei
20%

Preț: 607^.39 lei
20%

Preț: 538^.29 lei
Preț: 362^.24 lei
20%

Preț: 172^.69 lei
20%

Preț: 315^.78 lei
20%

Preț: 1343^.61 lei
20%

Preț: 554^.18 lei
20%

Preț: 724^.94 lei
20%

Preț: 784^.47 lei
20%

Preț: 301^.95 lei
20%

Preț: 504^.57 lei
20%

Preț: 724^.94 lei
20%

Preț: 369^.12 lei
20%

Preț: 335^.88 lei
20%

Preț: 551^.84 lei
Preț: 390^.40 lei
20%

Preț: 566^.56 lei
20%

Preț: 554^.18 lei
20%

Preț: 554^.18 lei
20%

Preț: 550^.28 lei
20%

Preț: 332^.75 lei
20%

Preț: 309^.90 lei
20%

Preț: 122^.89 lei

Cuprins

Elimination of negation in term algebras.- Rewrite orderings and termination of rewrite systems.- On the faithfulness of formal models.- Models for concurrency.- On a hierarchy of file types and a tower of their theories.- Strong conjunction and intersection types.- Partial higher-order specifications.- Unification in incompletely specified theories: A case study.- Observing localities.- Abstract dynamic data types: A temporal logic approach.- Generating words by cellular automata.- Atomic refinement in process description languages.- Recognizable complex trace languages (abstract).- Solving systems of linear diophantine equations: An algebraic approach.- A second-order pattern matching algorithm for the cube of typed ?-calculi.- The lazy call-by-value ?-calculus.- The limit of split n -bisimulations for CCS agents.- Stochastic automata and length distributions of rational languages.- Towards a categorical semantics of type classes.- Single-path Petri nets.- The bisection problem for graphs of degree 4 (configuring transputer systems).- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata.- Infinite normal forms for non-linear term rewriting systems.- Two algorithms for approxmate string matching in static texts.- Efficient constructions of test sets for regular and context-free languages.- The complexity of the reliable connectivity problem.- Pattern matching in order-sorted languages.- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus.- A solution of the complement problem in associatiue-commutatiue theories.- A model for real-time systems.- On strict codes.- A decidable case of the semi-unification problem.- Maintaining dictionaries in a hierarchical memory.-Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ?-BRANCHING PROGRAMs.- CCS dynamic bisimulation is progressing.- Syntax and semantics of a monotonic framework for non-monotonic reasoning.- On the cardinality of sets of infinite trees recognizable by finite automata.- Extending temporal logic by explicit concurrency.- An extensional partial combinatory algebra based on ?-terms.- Once more on order-sorted algebras.- Composition of two semi commutations.- An efficient decision algorithm for the uniform semi-unification problem extended abstract.- Different modifications of pointer machines and their computational power.