|
|
|
|
| LEADER |
04670nmm a2200373 u 4500 |
| 001 |
EB000657961 |
| 003 |
EBX01000000000000000511043 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540475798
|
| 100 |
1 |
|
|a Tarlecki, Andrzej
|
| 245 |
0 |
0 |
|a Mathematical Foundations of Computer Science 1991
|h Elektronische Ressource
|b 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings
|c by Andrzej Tarlecki
|
| 250 |
|
|
|a 1st ed. 1991
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1991, 1991
|
| 300 |
|
|
|a XI, 437 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 653 |
|
|
|a Computer systems
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer System Implementation
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Theory of Computation
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-54345-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-54345-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a 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
|