Mathematical foundations of computer science 1991 : 16th international symposium, Kazimierz Dolny, Poland, September 9-13, 1991 : proceedings
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 w...
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
520 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of computer science, 1991, 16th international symposium, Kazimierz Dolny, Poland, September 9-13, 1991, proceedings, A. Tarlecki (ed.), 1991, Berlin, Springer-Verlag, 1 vol. (XI-435 p.), Lecture notes in computer science, 3-540-54345-7 • Mathematical Foundations of Computer Science 1991, Texte imprimé, 9783662202142 |
| LEADER | 05943nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 943995 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155170880 | ||
| 020 | |a 9783540475798 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 004.0151 | ||
| 111 | 2 | |a Symposium on mathematical foundations of computer science |n (16 |d :1991 |c :Kazimierz Dolny, Pologne). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 1991 : |b 16th international symposium, Kazimierz Dolny, Poland, September 9-13, 1991 : proceedings |c [edited by] A. Tarlecki. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 520 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 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 -- 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 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. | ||
| 650 | |a Génie logiciel | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Informatique |x Mathématiques | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Tarlecki, Andrzej, |d 1956- |4 pbd | |
| 776 | 0 | |0 014181878 |t Mathematical foundations of computer science, 1991 |o 16th international symposium, Kazimierz Dolny, Poland, September 9-13, 1991 |o proceedings |f A. Tarlecki (ed.) |d 1991 |c Berlin |n Springer-Verlag |p 1 vol. (XI-435 p.) |s Lecture notes in computer science |z 3-540-54345-7 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1991 |b Texte imprimé |z 9783662202142 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-54345-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-4DTJX3BL-M |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747923701 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-54345-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750935979 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-54345-7 |z Accès INSA CVL | |
| 997 | |0 943995 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||