Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář
Resource Information
The instance Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář represents a material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Instance, Electronic.
The Resource
Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář
Resource Information
The instance Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář represents a material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Instance, Electronic.
 Label
 Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář
 Title remainder
 proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979
 Statement of responsibility
 edited by J. Bečvář
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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 forms1978  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 reductandclosure algorithm for graphs  Small universal Minsky machines  Parallel and twoway 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 and maximality 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 operatorprecedence parsing algorithms  On the languages of bounded Petri nets  Dyck language D2 is not absolutely parallel  Fixed points in the powerset algebra of infinite trees  On relaxation rules in algorithmic logic  LFuzzy 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 2tape 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
 Control code
 326963847
 Dimensions
 unknown
 Extent
 1 online resource (ix, 580 pages)
 Form of item
 online
 Isbn
 9780387095264
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540095268
 Other physical details
 illustrations.
 Record ID
 .b130107396
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)326963847
Context
Context of Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. BečvářEmbed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/resource/uh5ef8khiQ4/" typeof="Book http://bibfra.me/vocab/lite/Instance"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/resource/uh5ef8khiQ4/">Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Instance Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/resource/uh5ef8khiQ4/" typeof="Book http://bibfra.me/vocab/lite/Instance"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/resource/uh5ef8khiQ4/">Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>