The Resource Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář
Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář
Resource Information
The item Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, edited by J. Bečvář represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary
 What do an illegal drug importer, a stolen car exporter, a Hells Angels member, an accountant, and an airplane hijacker have in common? Like most people, they all operate in social networksand at times, they come together in criminal networks which, though tightly structured and controlled, undergo constant change. Inside Criminal Networks takes a social network perspective to a variety of illegal enterprises, focusing on these organizations' "flexible order" and the collective coping and adjustment strategies of offenders when key members or opportunities are lost. Rich with communication data, electronic surveillance material, and other lawenforcement investigative sources, case studies pursue a number of analytical paths into the partnerships, pecking orders, and situations in flux (e.g., street gang presence within drug distribution), and identify central challenges to research (e.g., are these failed networks if members are arrested?). Flexibility is revealed as a driving force as the book examines: Operational structures and dynamics. Roles of key and peripheral players. The tentative balance between efficiency and security. Criminal network positions and individual traits. Uses of legitimate actors in illegal settings. Adaptation when networks are disrupted. Compellingly written and meticulously presented, Inside Criminal Networks offers rare upclose insights to readers in the criminology and organized crime research fields, and to social network theorists and analysts
 Language
 eng
 Extent
 1 online resource (ix, 580 pages)
 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
 Isbn
 9780387095264
 Label
 Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979
 Title
 Mathematical foundations of computer science, 1979
 Title remainder
 proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979
 Statement of responsibility
 edited by J. Bečvář
 Subject

 Automates mathématiques, Théorie des  Congrès
 Computable functions
 Computable functions
 Computable functions  Congresses
 Computable functions  Congresses
 Computer algorithms
 Computer algorithms
 Computer algorithms  Congresses
 Computer algorithms  Congresses
 Computer programming
 Computer programming
 Computer programming  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Congressen (vorm)
 Electronic digital computers  Programming  Congresses
 Fonctions calculables  Congrès
 Fundamentele informatica
 Machine theory
 Machine theory
 Machine theory  Congresses
 Machine theory  Congresses
 Programmation (Informatique)  Congrès
 Algorithmes  Congrès
 Language
 eng
 Summary
 What do an illegal drug importer, a stolen car exporter, a Hells Angels member, an accountant, and an airplane hijacker have in common? Like most people, they all operate in social networksand at times, they come together in criminal networks which, though tightly structured and controlled, undergo constant change. Inside Criminal Networks takes a social network perspective to a variety of illegal enterprises, focusing on these organizations' "flexible order" and the collective coping and adjustment strategies of offenders when key members or opportunities are lost. Rich with communication data, electronic surveillance material, and other lawenforcement investigative sources, case studies pursue a number of analytical paths into the partnerships, pecking orders, and situations in flux (e.g., street gang presence within drug distribution), and identify central challenges to research (e.g., are these failed networks if members are arrested?). Flexibility is revealed as a driving force as the book examines: Operational structures and dynamics. Roles of key and peripheral players. The tentative balance between efficiency and security. Criminal network positions and individual traits. Uses of legitimate actors in illegal settings. Adaptation when networks are disrupted. Compellingly written and meticulously presented, Inside Criminal Networks offers rare upclose insights to readers in the criminology and organized crime research fields, and to social network theorists and analysts
 Cataloging source
 SCPER
 Dewey number
 519.7
 Illustrations
 illustrations
 Index
 no index present
 LC call number
 QA76.6
 LC item number
 .S9194 1979
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 1979
 http://bibfra.me/vocab/lite/meetingName
 Symposium on Mathematical Foundations of Computer Science (1972 )
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate
 1926
 http://library.link/vocab/relatedWorkOrContributorName
 Bečvář, J.
 Series statement
 Lecture notes in computer science
 Series volume
 74
 http://library.link/vocab/subjectName

 Computer programming
 Computer algorithms
 Computable functions
 Machine theory
 Algorithmes
 Programmation (Informatique)
 Fonctions calculables
 Automates mathématiques, Théorie des
 Computable functions
 Computer algorithms
 Computer programming
 Machine theory
 Fundamentele informatica
 Label
 Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, 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.
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)326963847
 Label
 Mathematical foundations of computer science, 1979 : proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 37, 1979, 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.
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)326963847
Subject
 Automates mathématiques, Théorie des  Congrès
 Computable functions
 Computable functions
 Computable functions  Congresses
 Computable functions  Congresses
 Computer algorithms
 Computer algorithms
 Computer algorithms  Congresses
 Computer algorithms  Congresses
 Computer programming
 Computer programming
 Computer programming  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Congressen (vorm)
 Electronic digital computers  Programming  Congresses
 Fonctions calculables  Congrès
 Fundamentele informatica
 Machine theory
 Machine theory
 Machine theory  Congresses
 Machine theory  Congresses
 Programmation (Informatique)  Congrès
 Algorithmes  Congrès
Genre
Member of
Library Links
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/portal/Mathematicalfoundationsofcomputerscience/uh5ef8khiQ4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Mathematicalfoundationsofcomputerscience/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 Item 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/portal/Mathematicalfoundationsofcomputerscience/uh5ef8khiQ4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Mathematicalfoundationsofcomputerscience/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>