Mathematical foundations of computer science 1979 : proceedings, 8th symposium, Olomouc, Czechoslovakia, September 3-7, 1979
Bewaard in:
| Coauteur: | |
|---|---|
| Andere auteurs: | |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science
74 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
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 1979, proceedings, 8th symposium, Olomouc, Czechoslovakia, September 3-7, 1979, edited by J. Bečvář, Berlin, Springer-Verlag, 1979, 1 vol. (IX-579 p.), Lecture notes in computer science, 3-540-09526-8 • Mathematical Foundations of Computer Science 1979, Texte imprimé, 9783662192337 |
| LEADER | 05504nam a22003737a 4500 | ||
|---|---|---|---|
| 001 | 969339 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155171895 | ||
| 020 | |a 9783540350880 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 510 | ||
| 111 | 2 | |a Symposium on mathematical foundations of computer science |n (08 |d :1979 |c :Olomouc, République tchèque). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 1979 : |b proceedings, 8th symposium, Olomouc, Czechoslovakia, September 3-7, 1979 |c edited by J. Bečvář. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 74 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a A sound and complete proof system for partial program correctness -- The problem of reachability and verification of programs -- Assertion programming -- Complexity classes of formal languages -- Fast probabilistic algorithms -- Relative succinctness of representations of languages and separation of complexity classes -- On two types of loops -- Full abstraction for a simple parallel programming language -- On some developments in cryptography and their applications to computer science -- Searching, sorting and information theory -- Lcf: A way of doing proofs with a machine -- Axioms or algorithms -- Power from power series -- Computational complexity of string and graph ident ification -- A survey of grammar and l forms-1978 -- A theoretical study on the time analysis of programs -- Completeness problems in verification of programs and program schemes -- Relationships between AFDL's and cylinders -- Computable data types -- Program equivalence and provability -- Interactive L systems with almost interactionless behaviour -- On the simplification of constructions in degrees of unsolvability via computational complexity -- An algebraic extension of the Chomsky hierarchy -- Bounds on computational complexity and approximability of initial segments of recursive sets -- On the weighted path length of binary search trees for unknown access probabilities -- Computational complexity of approximation algorithms for combinatorial problems -- A reduct-and-closure algorithm for graphs -- Small universal Minsky machines -- Parallel and two-way recognizers of directed acyclic graphs -- Fully effective solutions of recursive domain equations -- A note on computational complexity of a statistical deducibility testing procedure -- Context free normal systems -- New proofs for jump dpda's -- Synchronization andmaximality for very pure subsemigroups of a free semigroup -- On the sets of minimal indices of partial recursive functions -- Some remarks on Boolean sums -- On the propositional algorithmic logic -- Ch(k) grammars: A characterization of LL(k) languages -- A uniform approach to balanced binary and multiway trees -- On the generative capacity of some classes of grammars with regulated rewriting -- Validity test for Floyd's operator-precedence parsing algorithms -- On the languages of bounded Petri nets -- Dyck language D2 is not absolutely parallel -- Fixed points in the power-set algebra of infinite trees -- On relaxation rules in algorithmic logic -- L-Fuzzy functorial automata -- Schematics of structural parallel programming and its applications -- On axiomatization of deterministic propositional dynamic logic -- Bounded recursion and complexity classes -- Characterization of rational and algebraic power series -- A crossing measure for 2-tape Turing machines -- The complexity of lexicographic sorting and searching -- An algebraic approach to concurrence -- On multitape automata -- A turing machine oracle hierarchy -- A survey of some syntactic results in the ?-calculus -- On rational expressions representing infinite rational trees : Application to the structure of flow charts. | |
| 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 | ||
| 650 | |a Langages formels | ||
| 650 | |a Mathématiques | ||
| 650 | |a Théorie des machines séquentielles | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Bečvář, Jíří, |d 1926- |4 pbd | |
| 776 | 0 | |0 019324383 |t Mathematical foundations of computer science 1979 |o proceedings, 8th symposium, Olomouc, Czechoslovakia, September 3-7, 1979 |f edited by J. Bečvář |c Berlin |n Springer-Verlag |d 1979 |p 1 vol. (IX-579 p.) |s Lecture notes in computer science |z 3-540-09526-8 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1979 |b Texte imprimé |z 9783662192337 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-09526-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-P97FW3NR-5 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750675063 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-09526-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754023559 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-09526-8 |z Accès INSA CVL | |
| 997 | |0 969339 |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/ | ||