Mathematical foundations of computer science 1992 : 17th International Symposium, Prague, Czechoslovakia, August 24 28, 1992 : proceedings
This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia s...
Shranjeno v:
| Korporativna značnica: | |
|---|---|
| Drugi avtorji: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
629 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
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 1992, proceedings, 17th International symposium, Prague, Czechoslovakia, August 24-28, 1992, I. M. Havel, V. Koubek (eds.), Berlin, Springer-Verlag, 1992, 1 vol. (IX-521 p.), Lecture notes in computer science, 3-540-55808-X • Mathematical Foundations of Computer Science 1992, Texte imprimé, 9783662194454 |
| LEADER | 06228nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 944819 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155203266 | ||
| 020 | |a 9783540472919 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004.0151 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on mathematical foundations of computer science |n (17 |d :1992 |c :Prague, République tchèque). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 1992 : |b 17th International Symposium, Prague, Czechoslovakia, August 24 28, 1992 : proceedings |c [edited by] I. M. Havel, V. Koubek. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 629 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a On range searching with semialgebraic sets -- Graph layout problems -- Parallel recognition and ranking of context-free languages -- On the expansion of combinatorial polytopes -- Neural networks and complexity theory -- Theory of computation over stream algebras, and its applications -- Methods in parallel algorithmcs -- On the complexity of small description and related topics -- Weak parallel machines: A new class of physically feasible parallel machine models -- The complexity of graph connectivity -- A perfect parallel dictionary -- Some remarks on the test complexity of iterative logic arrays -- The degree structure of 1-L reductions -- Promise problems and access to unambiguous computation -- On the complexity of incremental computation -- Rational transductions and complexity of counting problems -- Negation elimination in equational formulae -- Object interaction -- Strong normalization of substitutions -- Probabilistic and pluralistic learners with mind changes -- Parallel complexity of iterated morphisms and the arithmetic of small numbers -- On computational power of weighted finite automata -- The shuffle exchange network has a Hamiltonian path -- Poset properties of complex traces -- A threshold for unsatisfiability -- Dataflow semantics for Petri nets -- About boundedness for some datalog and DATALOGneg programs -- Merging and sorting strings in parallel -- Characterization of context-pree languages by erasing automata -- Insertion and deletion of words: Determinism and reversibility -- Small universal one-state linear operator algorithm -- Mobility in the CC-paradigm -- The emptiness problem for intersections of regular languages -- On finite automata with limited nondeterminism (extended abstract) -- Definitions and comparisons of local computations on graphs -- Efficient unidimensionaluniversal cellular automaton -- Inferring a tree from walks -- Almost every set in exponential time is P-bi-immune -- A functorial semantics for observed concurrency -- Modelling concurrency with semi-commutations -- Decision problems for cellular automata and their semigroups -- On the nature of events -- New parallel algorithms for convex hull and triangulation in 3-dimensional space -- Two simple characterizations of well-founded semantics -- Fully abstract semantics for higher order communicating systems -- Superposable Trellis Automata -- Maintaining proximity in higher dimensional spaces -- Characterizing regular languages with polynomial densities -- A strategy for speeding-up the computation of characteristic sets -- One-rule trace-rewriting systems and confluence. | |
| 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 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. 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. Numerous topics are covered in this volume. The invited papers cover: range searching with semialgebraic sets, graph layout problems, parallel recognition and ranking of context-free languages, expansion of combinatorial polytopes, neural networks and complexity theory, theory of computation over stream algebras, methods in parallel algorithms, the complexity of small descriptions, weak parallel machines, and the complexity of graph connectivity. | ||
| 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 Havel, Ivan Miloš, |d 1938-2021. |4 pbd | |
| 700 | 1 | |a Koubek, Václav, |d 1948-2016. |4 pbd | |
| 776 | 0 | |0 014807769 |t Mathematical foundations of computer science 1992 |o proceedings, 17th International symposium, Prague, Czechoslovakia, August 24-28, 1992 |f I. M. Havel, V. Koubek (eds.) |c Berlin |n Springer-Verlag |d 1992 |p 1 vol. (IX-521 p.) |s Lecture notes in computer science |z 3-540-55808-X | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1992 |b Texte imprimé |z 9783662194454 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-55808-X |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-J5XCNT2S-0 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747916225 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-55808-X |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750928832 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-55808-X |z Accès INSA CVL | |
| 997 | |0 944819 |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/ | ||