Mathematical foundations of computer science 1977 : proceedings, 6th Symposium, Tatranská Lomnica, September 5-9, 1977
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
53 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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 1977, proceedings, 6th Symposium, Tatranská Lomnica, September 5-9, 1977, edited by J. Gruska, Berlin, Springer-Verlag, 1977, 1 vol. (X-595 p.), Lecture notes in computer science, 0-387-08353-7 • Mathematical Foundations of Computer Science 1977, Texte imprimé, 9783662200827 |
| LEADER | 06077nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 943869 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155166794 | ||
| 020 | |a 9783540372851 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 001.64 | ||
| 111 | 2 | |a Symposium on mathematical foundations of computer science |n (06 |d :1977 |c :Tatranská Lomnica, Slovaquie). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 1977 : |b proceedings, 6th Symposium, Tatranská Lomnica, September 5-9, 1977 |c edited by J. Gruska. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 53 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a On the structure and properties of NP-complete problems and their associated optimization problems -- A comparative review of some program verification methods -- Classification of the context-free languages -- Finite automaton from a flowchart scheme point of view -- A new type of models of computation -- Correctness of mixed computation in ALGOL-like programs -- Algebra and logic in theoretical computer science -- A survey of recent problems and results in analytic computational complexity -- Tree-structures for set manipulation problems -- Applied algorithmic logic -- Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials -- Frequency algorithms and computations -- Graph-theoretic arguments in low-level complexity -- Properties of complexity classes a short survey -- A uniform approach to inductive posets and inductive closure -- Generalized probabilistic grammars -- Classes of structurally isomorphic np-optimization problems -- Pushdown-automata and families of languages generating cylinders -- Semantics of infinite processes using generalized trees -- Characterization of recognizable families by means of regular languages -- An algebraic approach to problem solution and problem semantics -- Complexity and minimality of context-free grammars and languages -- Comparison of the active visiting and the crossing complexities -- Arithmetical complexity of some problems in computer science -- Formal transformations and the development of programs -- Optimal rasp programs for arbitrarily complex 0 1 valued functions -- The expressive power of intensional logic in the semantics of programming languages -- On the complexity of equivalent transformations in programming languages -- Schematology in a MJ I/T I-language OPT imizer -- Decidability(undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions -- A top-down no backtrack parsing of general context-free languages -- A probabilistic restriction of branching plans -- Reducing operators for normed general formal systems -- Invariant properties of informational bulks -- Two decidability results for deterministic pushdown automata -- On the logic of incomplete information -- Measures of ambiguity in the analysis of complex systems -- Two-level meta-controlled substitution grammars -- A calculus to build up correct programs -- Another approach for proving program correctness -- Cover results and normal forms -- On a deterministic subclass of context-free languages -- Exponential optimization for the LLP(k) parsing method -- The medial axis of a simple polygon -- Semantics and proof rules for coroutine hierarchies in block-structured programming languages -- Acceptors for iteration languages -- How good is the adversary lower bound ? -- Total correctness for procedures -- A model for retrieval systems and some mathematical problems behind -- Time and tape bounded auxiliary pushdown automata -- A fast non-commutative algorithm for matrix multiplication -- Fixed-points and algebras with infinitely long expressions, I -- On languages, accepted by machines in the category of sets -- Real time computations with restrictions on tape alphabet -- The bodnarchuk metric space of languages and the topology of the learning space -- Complexity hierarchies of oracles -- Determining processes by violations -- The influence of the machine model on the time complexity of context-free language recognition -- A generalized computability thesis -- Identification of formal languages -- Correctness of recursive flow diagram programs. | |
| 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 Informatique | ||
| 650 | |a Langages formels | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Automates mathématiques, Théorie des | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Gruska, Jozef, |d 1933- |4 pbd | |
| 776 | 0 | |0 018131050 |t Mathematical foundations of computer science 1977 |o proceedings, 6th Symposium, Tatranská Lomnica, September 5-9, 1977 |f edited by J. Gruska |c Berlin |n Springer-Verlag |d 1977 |p 1 vol. (X-595 p.) |s Lecture notes in computer science |z 0-387-08353-7 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1977 |b Texte imprimé |z 9783662200827 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-08353-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-81J2HF3Z-N |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747924961 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-08353-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750937092 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-08353-7 |z Accès INSA CVL | |
| 997 | |0 943869 |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/ | ||