Fundamentals of Computation Theory: 10th International Conference, FCT '95, Dresden, Germany, August 22 - 25, 1995. ProceedingsHorst Reichel Springer Science & Business Media, 16.08.1995 - 441 Seiten This book presents the proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT '95, held in Dresden, Germany in August 1995. The volume contains five invited lectures and 32 revised papers carefully selected for presentation at FCT '95. A broad spectrum of theoretical computer science is covered; among topics addressed are algorithms and data structures, automata and formal languages, categories and types, computability and complexity, computational logics, computational geometry, systems specification, learning theory, parallelism and concurrency, rewriting and high-level replacement systems, and semantics. |
Inhalt
I | 1 |
II | 16 |
III | 42 |
IV | 62 |
V | 89 |
VI | 106 |
VII | 116 |
VIII | 126 |
XXI | 253 |
XXII | 263 |
XXIII | 273 |
XXIV | 283 |
XXV | 293 |
XXVI | 303 |
XXVII | 313 |
XXVIII | 323 |
IX | 136 |
X | 146 |
XI | 156 |
XII | 171 |
XIII | 181 |
XIV | 191 |
XV | 201 |
XVII | 211 |
XVIII | 221 |
XIX | 233 |
XX | 243 |
XXIX | 333 |
XXX | 343 |
XXXII | 353 |
XXXIII | 363 |
XXXIV | 374 |
XXXV | 383 |
XXXVI | 393 |
XXXVII | 404 |
XXXVIII | 414 |
XXXIX | 424 |
Andere Ausgaben - Alle anzeigen
Fundamentals of Computation Theory: 10th International Conference, FCT '95 ... Horst Reichel Keine Leseprobe verfügbar - 1995 |
Fundamentals of Computation Theory: 10th International Conference, FCT '95 ... Horst Reichel Keine Leseprobe verfügbar - 2014 |
Häufige Begriffe und Wortgruppen
A-nets abstract algorithm alphabet arrow automaton axioms basic bisimulation bounded called Cayley graph cell cellular automata chordal graphs clock cograph complexity Computer Science configuration consider constraint construction cycle D₁ defined Definition denote derivation deterministic Duration Calculus edge edit distance equations equivalent evaluation example exists exponential expression finite formal formula given import node input labelled language Lemma LNCS logic logspace method monoids multiset nondeterministic notation notion object operation pair parallel Petri nets polynomial probabilistic problem process algebra processors proof properties PSPACE pushdown automata r-dominating clique reachability rectilinear polygon reduction relation result rewriting rules satisfies semantics semi-traces sort space step structure subgraph subset subtyping symbol synchronization t₁ term Theorem theory tiling transformation transition tree Turing machines u₁ variables vector vertex vertices Voronoi diagram word Zhou Chaochen