Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Computation Theory

10th International Conference, FCT '95, Dresden, Germany, August 22 - 25, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Horst Reichel
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 965)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (37 papers)

  1. Front Matter

    Download chapter PDF

  2. Discrete time process algebra with abstraction

    • J. C. M. Baeten, J. A. Bergstra
    Pages 1-15

  3. A duration calculus with infinite intervals

    • Zhou Chaochen, Dang Van Hung, Li Xiaoshan
    Pages 16-41

  4. A delegation-based object calculus with subtyping

    • Kathleen Fisher, John C. Mitchell
    Pages 42-61

  5. Model-checking for real-time systems

    • Kim G. Larsen, Paul Pettersson, Wang Yi
    Pages 62-88

  6. On polynomial ideals, their complexity, and applications

    • Ernst W. Mayr
    Pages 89-105

  7. From a concurrent λ-calculus to the π-calculus

    • Roberto M. Amadio, Lone Leth, Bent Thomsen
    Pages 106-115

  8. Rewriting regular inequalities

    • Valentin Antimirov
    Pages 116-125

  9. A simple abstract semantics for equational theories

    • Gilles Barthe
    Pages 126-135

  10. Processes with multiple entries and exits

    • J. A. Bergstra, Gh. Åžtefaonescu
    Pages 136-145

  11. Efficient rewriting in cograph trace monoids

    • Michael Bertol
    Pages 146-155

  12. Effective category and measure in abstract complexity theory

    • Cristian Calude, Marius Zimand
    Pages 156-170

  13. About planar cayley graphs

    • Thomas Chaboud
    Pages 171-180

  14. On condorcet and median points of simple rectilinear polygons

    • Victor D. Chepoi, Feodor F. Dragan
    Pages 181-190

  15. Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs

    • Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Pages 191-200

  16. r-Domination problems on homogeneously orderable graphs

    • Feodor F. Dragan, Falk Nicolai
    Pages 201-210

  17. Growing patterns in 1D cellular automata

    • Bruno Durand, Jacques Mazoyer
    Pages 211-220

  18. Petri nets, commutative context-free grammars, and basic parallel processes

    • Javier Esparza
    Pages 221-232

  19. Implementation of a UU-algorithm for primitive recursive tree functions

    • Heinz Faßbender
    Pages 233-242

  20. Dummy elimination: Making termination easier

    • M. C. F. Ferreira, H. Zantema
    Pages 243-252
Back to top

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation