Mathematical Foundations of Computer Science 1988: 13th Symposium Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Proceedings
Springer Science & Business Media, Aug 10, 1988 - Computers - 562 pages
This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
accepting actions algebra algorithm apply automaton behaviour Boolean bound called circuits complexity components Computer Computer Science concurrent condition connected consider construction contains corresponding defined definition denote derivation described deterministic edges element embedding equivalent example exists expressions fact Figure finite formula function give given graph hence holds homogeneous induction infinite initial input instance introduced labelled language least Lemma length lower machine marking maximal means nets nodes normal Note obtain occur operations oracle parallel partial path Petri polynomial positive possible prefix present problem procedure processor programs proof Proposition prove recursive reducibilities relation represented respect restricted result root rules satisfying semantics separator sequence shown simulated space sparse specification step string structure subset symbol Theorem Theory transition tree Turing variables vertex vertices