Mathematical Foundations of Computer Science 1979

8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings

AvJ. Becvar

Häftad, Engelska, 1979

Del i serien Lecture Notes in Computer Science

446 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1979-07-01
Mått:155 x 235 x 32 mm
Vikt:890 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:585
Upplaga:1979
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540095262

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematik inom Naturvetenskap och teknik

Innehållsförteckning

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

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Mathematical Foundations of Computer Science 1975

J. Becvar

Häftad, 1975

572 kr

Signerad!

SIGNERAD - Om julens wälgång

Klara Peters Bastin

Inbunden, 2026

249 kr

Ruth Kvarnström-Jones - SIGNERAD - Systrarna på Sophiahemmet, Inbunden

Signerad!

Del 3

SIGNERAD - Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

249 kr

-21%

Ha en nice dag

Mikael Yvesand

Inbunden, 2026

189 kr239 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

269 kr

Nyhet

Svanesång : min syster Diana

Charles Spencer

Inbunden, 2026

269 kr

-30%

Se dig inte om

Harlan Coben

Pocket, 2026

69 kr99 kr

Nyhet

Del 11

Medusa

Lars Kepler

Ljudbok

2026

(1)

149 kr

-19%

Stortaxi

Flora Wiström

Inbunden, 2026

(3)

209 kr259 kr

Mathematical Foundations of Computer Science 1979

8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings

AvJ. Becvar

Häftad, Engelska, 1979

Del i serien Lecture Notes in Computer Science

446 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1979-07-01
Mått:155 x 235 x 32 mm
Vikt:890 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:585
Upplaga:1979
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540095262

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematik inom Naturvetenskap och teknik

Innehållsförteckning

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.