Mathematical foundations of computer science : 3rd Symposium at Jadwisin near Warsaw, June 17-22, 1974

Gardado en:
Detalles Bibliográficos
Autor Corporativo: Symposium on Mathematical Foundations of Computer Science :Jadwisin, Pologne
Outros autores: Blikle, Andrzej Jacek, 1939- (Directeur de la publication)
Formato: Livre numérique
Idioma:Anglais
Publicado: Berlin [etc.] : Springer 2005.
Cham : Springer Nature
Series:Lecture notes in computer science 28
Sujets:
Acceso en liña:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: 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, 3rd Symposium, [organised by the Computation Center of the Polish Academy of Sciences] at Jadwisin near Warsaw, June 17-22, 1974, 1975, Berlin, Springer, 1 vol. (VII-484 p.), Lecture notes in computer science, 0-387-07162-8
• Mathematical Foundations of Computer Science 1974, Texte imprimé, 9783662193969
LEADER 04932nam a22004577a 4500
001 944182
008 110927q2005 xxe ||| |||| 00| 0 eng d
009 PPN155177974
020 |a 9783540374923 (PDF) 
041 0 |a eng 
082 |a 519.4 
082 |a 004 
084 |a 68A05. 1970 
084 |a 68A20. 1970 
084 |a 68A25. 1970 
084 |a 68A30. 1970 
084 |a 68A50. 1970 
111 2 |a Symposium on Mathematical Foundations of Computer Science  |n (03  |d  :1974  |c  :Jadwisin, Pologne). 
245 1 0 |a Mathematical foundations of computer science :  |b 3rd Symposium at Jadwisin near Warsaw, June 17-22, 1974   |c edited by A. Blikle. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c 2005. 
490 0 |a Lecture notes in computer science  |v 28  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Sequential functions and generalized Moore and Mealy automata -- Mathematical methods of the theory of stochastic automata -- On the quasi-controllability of automata -- Models for analysis of races in sequential networks -- Factorizations, congruences, and the decomposition of automata and systems -- On the periodic sum and extensions of finite automata -- Finite branching automata: automata theory motivated by problem solving -- On configurations in cellular automata -- Finite automata acceptation of infinite sequences -- R-fuzzy automata with a time-variant structure -- Functions computable in the limit by probabilistic machines -- Some properties of limit recursive functions -- On some approximation problems of continuous computation -- Set-theoretic properties of programs in stored program computers -- Classification of programs of a SPC -- The algebraic approach to the theory of computing systems -- Continuous simple Z-machines, Z-computable functions and sets of functions of n real variables -- An approach to correctness proofs of semicoroutines -- Towards an understanding of complex processes -- Simulation -- Concurrent programs -- Ultralinear expressions -- A family of algebraic systems related to the theory of equations on free monoids -- Stretching by probabilistic tree automata and Santos grammars -- Top down versus bottom up syntax analysis revised -- Substring languages -- Defining languages by Mazurkiewicz aigorithms -- Complexity and normal forms of context-free languages -- The axiomatization problem of a theory of linear languages -- A lattice-theoretical approach to problem-solving -- On the equivalence of planar grammars and parallel picture processing algorithms -- Combinatorial aspects of information storage and retrieval -- Modular approach to the logical theory of programs -- Proving programs by sets of computations -- Bases of paths in correctness proofs -- Algebraic models I -- Structured programmability of iterative algorithms -- On equivalence of programs -- Mathematical model of programs with dynamic allocation of variables -- Mathematical foundations of motivation languages and synthesis maps -- The semantics of semantic equations -- ?+ -valued algorithmic logic as a tool to investigate procedures -- Call-by-value versus call-by-name: A proof-theoretic comparison -- Procedures, formal computations and models. 
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 Blikle, Andrzej Jacek,  |d 1939-  |4 pbd 
776 0 |0 012351709  |t Mathematical foundations of computer science  |o 3rd Symposium  |f [organised by the Computation Center of the Polish Academy of Sciences] at Jadwisin near Warsaw, June 17-22, 1974  |d 1975  |c Berlin  |n Springer  |p 1 vol. (VII-484 p.)  |s Lecture notes in computer science  |z 0-387-07162-8 
776 0 |t Mathematical Foundations of Computer Science 1974  |b Texte imprimé  |z 9783662193969 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-07162-8  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-HNLDRZMB-M  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747922004  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-07162-8  |z Accès Université d'Orléans 
856 4 |5 180339901:750934352  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-07162-8  |z Accès INSA CVL 
997 |0 944182  |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/