Del i serien Lecture Notes in Computer Science
Mathematical Foundations of Computer Science 1979
8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings
569 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Produktinformation
- Utgivningsdatum1979-07-01
- Mått155 x 235 x 32 mm
- Vikt890 g
- FormatHäftad
- SpråkEngelska
- SerieLecture Notes in Computer Science
- Antal sidor585
- Upplaga1979
- FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN9783540095262
Tillhör följande kategorier
- 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.
Du kanske också är intresserad av
- Nyhet
- Nyhet
Omvårdnadens grunder - paket
Sofia Almerud, Annica Backman, Anna-Karin Edberg, Anna Ehrenberg, My Engström, Katarina Göransson, Lena Marmstål Hammar, Stefan Nilsson, Lars Wallin, Helle Wijk, Joakim Öhlén, Lilas Ali, Anette Alvariza, Ann-Christine Andersson, Pia Andersson, Anna Anåker, Charlotta van Eggermont Arwidson, Margareta Asp, Åsa Audulv, Malin Axelsson, Mariette Bengtsson, Eva Benzein, Lena Berg, Monica Bergqvist, Eva-Karin Bergström, Ida Björkman, Catrin Björvell, Angela Bång, Carina Bååth, Josefin Bäckström, Karin Bölenius, David Edvardsson, Rakel Eklund, Inger Ekman, Mirjam Ekstedt, Ann Catrine Eldh, Karin Enskär, Sofia Erestam, Anneli Eriksson, Henrik Eriksson, Marie Ernsth Bravell, Jan Florin, Anna Forsberg, Henrietta Forsman, Anette Forss, Mio Fredriksson, Febe Friberg, Maria Grandahl, Tanja Gustafsson, Agneta Gånemo, Elizabeth Hanson, Malin Hansson, Amanda Hellström, Ingela Henoch, Inger Jansson, Maria Jirwe, Lena Johansson, Pauline Johansson, Unn-Britt Johansson, Birgitta Kerstis, Ann-Sofie Källberg, Ulrika Källman, Anita Kärner Köhler, Cecilia Larsdotter, Margret Lepp, Maria Lindström Nilsson, Mikael Lundmark, Anneli Löf, Lennart Magnusson, Catharina Melander, Jenny Milton, Beata Molin, Annika Nordin, Maria Norinder, Sepideh Olausson, Carina Persson, Kerstin Prignitz Sluys, Josefin Rahmqvist, Birgit Holritz Rasmussen, Anneli Ringblom, Karin C. Ringsberg, Ann Rudman, Ann-Marie Rydholm Hedman, Silje Rysst, Lars Sandman, Regina Santamäki Fischer, Britt-Inger Saveman, Johanna Sjömar, Karin Stenzelius, Anna Strömberg, Annelie J. Sundler, Märtha Sund Levander, Kristina Svantesson, Anna Swall, Susanne Syrén, Pia Tingström, Johanna Ulfvarson, Sara Wallström, Albert Westergren, Lena Wiklund Gustin, Ulrika Winblad
Häftad, 2025
1 569 kr
- Nyhet