## Mathematical Foundations of Computer Science 1995: 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. ProceedingsThis book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi. |

### What people are saying - Write a review

User Review - Flag as inappropriate

mathimatical foundations and computer science 1995:20th...,issue 520

### Contents

I | 1 |

II | 21 |

III | 37 |

IV | 50 |

V | 66 |

VI | 82 |

VII | 93 |

VIII | 94 |

XXXII | 309 |

XXXIII | 319 |

XXXIV | 326 |

XXXV | 337 |

XXXVI | 349 |

XXXVII | 359 |

XXXIX | 371 |

XL | 382 |

IX | 105 |

X | 106 |

XI | 129 |

XII | 139 |

XIII | 149 |

XIV | 159 |

XV | 169 |

XVII | 179 |

XIX | 191 |

XX | 201 |

XXI | 211 |

XXII | 221 |

XXIII | 227 |

XXIV | 237 |

XXV | 247 |

XXVII | 257 |

XXVIII | 267 |

XXIX | 277 |

XXX | 288 |

XXXI | 299 |

### Other editions - View all

Mathematical Foundations of Computer Science 1995: 20th International ... Jiri Wiedermann,Petr Hajek No preview available - 2014 |

### Common terms and phrases

accepting action algorithm applied approximate assignment assume automata automaton binary bits bounded called cells classes communication complexity computation Computer Science connected consider constant construction contains corresponding counting defined definition denote deterministic distribution edges elements equal equations equivalent example exists expression extended finite formula function given gives grammar graph Hence holds implies infinite input labeled language least Lemma length linear logic lower bounds means measure mesh messages natural nodes normal Note notion object observe obtained operator optimal parallel partial path performed polynomial positive possible probability problem processes processor proof properties Proposition prove random recursive reduction relation represented requires respect routing rules satisfying sequence simulation solution space steps string structure symbols Theorem theory transition tree Turing machine variables