Mathematical Foundations of Computer Science 1979 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1979, 1979
|
| Edition: | 1st ed. 1979 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 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 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
- 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