Mathematical Foundations of Computer Science 1976 : proceedings, 5th Symposium, Gdańsk, September 6 10, 1976
保存先:
| 団体著者: | |
|---|---|
| その他の著者: | |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
2005.
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
45 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
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 1976, proceedings 5th Symposium, Gdańsk, September 6 -10, 1976, [organized by the Computation Centre of the Polish Academy of Sciences in cooperation with the University of Gdańsk], Berlin, Springer, 1976, 1 vol. (XI-606 p.), Lecture notes in computer science, 3-540-07854-1 • Mathematical Foundations of Computer Science 1976, Texte imprimé, 9783662169216 |
| LEADER | 06992nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 944911 | ||
| 008 | 110927q2005 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15520680X | ||
| 020 | |a 9783540381693 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.3 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on Mathematical Foundations of Computer Science |n (05 |d :1976 |c :Gdańsk). | |
| 245 | 1 | 0 | |a Mathematical Foundations of Computer Science 1976 : |b proceedings, 5th Symposium, Gdańsk, September 6 10, 1976 |c edited by A. Mazurkiewicz. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c 2005. | ||
| 490 | 0 | |a Lecture notes in computer science |v 45 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Exercises in denotational semantics -- W-automata and their languages -- On semantic issues in the relational model of data -- The effective arrangement of logical systems -- Recursivity, sequence recursivity, stack recursivity and semantics of programs -- Descriptional complexity (of languages) a short survey -- On the branching structure of languages -- Algorithms and real numbers -- On mappings of machines -- Recent results on L systems -- Decision problems for multi-tape automata -- Recursive program schemes and computable functionals -- Some fundamentals of order-algebraic semantics -- On attribute grammars -- Formal definition of semantics of generalized control regimes -- Minimal while programs -- On specific features of recognizable families of languages -- On the termination of simple computer programs -- Reduction of Petri-nets -- On behaviour of R-fuzzy automata -- Cannonizing reducibility method in the theory of program schemata -- Strongly connected G-S-M mappings preserving conjugation -- Analysis of the non-context-free component of formal languages -- Programs, computations and temporal features -- A note on the automatic generation of inductive assertions -- On the relationship between a procedure and its data -- On the relativization of deterministic and nondeterministic complexity classes -- The metric properties on the semigroups and the languages -- A lower bound of 1/2n2 on linear search programs for the knapsack problem -- The direct product of automata and quasi-automata -- An axiomatic approach to information structures -- Parallelism of manipulations in multidimensional information structures -- On strict interpretations of grammar forms -- A hierarchy of context-sensitive languages -- On consecutive storage of records -- A remark on equivalence of Mazurkiewicz's finite control algorithms over nets -- Microprogram Oriented model of the controlled structure -- Relations between programs with different storage requirements -- An algebraic approach to data types, program verification, and program synthesis -- About three equational classes of languages built up by shuffle operations -- A machine independent description of complexity classes, definable by nondeterministic as well as deterministic turing machines with primitiv recursive tape or time bounds -- Schemes with recursion on higher types -- Constructing iterative version of a system of recursive procedures -- A method using a set-theoretical formalism to describe the semantics of programming languages -- The cubic search method -- Vectors of coroutines -- One one degrees of Turing machines decision problems -- Heuristic representation of state-space by finite automaton -- Semigroup characterizations of some language varieties -- On memory requirements of Strassen's algorithms -- Determinism in concurrent systems -- Generating control mechanisms by restrictions -- On diagnosis of algorithmical processes -- On some properties of cyclic automata and their extensions -- Compiler generation using denotational semantics -- On divergence problem for program schemas -- On the parsing of LL-regular grammars -- The characteristic polynomial of a finite automaton -- Error detection using regular languages -- On a relationship between programs of address machines and Mazurkiewicz algorithms -- DIJKSTRA's predicate transformer, non-determinism, recursion, and termination -- Context-free programmed grammars and ETOL systems -- Context-free algebra: A mathematical device for compiler specification -- On the lower bound for minimum comparison selection -- Computational processes generated by programs with/recursive/ procedures and block structures -- An algebraic framework for the study of the syntactic monoids application to the group languages -- Degrees of parallelism in computations -- On adaptability of a system of programs -- A mathematical model of parallel information processing -- Powerdomains -- On the domain of iteration in iterative algebraic theories -- The influence of the data presentation on the computational power of machines -- On sequential modelling of non-sequential processes -- Equivalence and optimization of recursive program schemata -- Observability concepts in abstract data type specification -- The calculus of facts -- Multiplicity functions on ?-automata -- A complete axiomatic characterization of algorithmic properties of block-structured programs with procedures. | |
| 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 Automates mathématiques, Théorie des | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Mazurkiewicz, Antoni, |d 1934- |4 pbd | |
| 710 | 2 | |a Polska akademia nauk. |4 orm | |
| 710 | 2 | |a University of Gdańsk. |4 orm | |
| 776 | 0 | |0 017419794 |t Mathematical foundations of computer science 1976 |o proceedings 5th Symposium, Gdańsk, September 6 -10, 1976 |f [organized by the Computation Centre of the Polish Academy of Sciences in cooperation with the University of Gdańsk] |c Berlin |n Springer |d 1976 |p 1 vol. (XI-606 p.) |s Lecture notes in computer science |z 3-540-07854-1 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1976 |b Texte imprimé |z 9783662169216 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-07854-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-0G3PFV9K-7 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747915369 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-07854-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750927992 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-07854-1 |z Accès INSA CVL | |
| 997 | |0 944911 |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/ | ||