Skip to main content
SpringerLink
Log in

Fundamentals of Computation Theory

12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Gabriel Ciobanu

    1. Faculty of Computer Science, “A.I.Cuza” University, Iaşi, Romania

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gheorghe Păun

    1. Institute of Mathematics of the Romanian Academy, Bucharest, Romania

    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 1684)

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

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (47 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Randomized complexity of linear arrangements and polyhedra?

    • Marek Karpinski
    Pages 1-12

  3. Tile transition systems as structured coalgebras?

    • Andrea Corradini, Reiko Heckel, Ugo Montanari
    Pages 13-38

  4. Caesar and DNA — views on cryptology

    • Arto Salomaa
    Pages 39-53

  5. Automata and their interaction: Definitional suggestions

    • Boris A. Trakhtenbrot
    Pages 54-89

  6. Axiomatising asynchronous process calculi

    • Matthew Hennessy
    Pages 90-90

  7. A polynomial time approximation scheme for dense MupIN 2S{upAT}

    • Cristina Bazgan, W. de la Fernandez Vega
    Pages 91-99

  8. Decidable classes of the verification problem in a timed predicate logic

    • Danièle Beauquier, Anatol Slissenko
    Pages 100-111

  9. Interpretations of extensible objects and types

    • Viviana Bono, Michele Bugliesi
    Pages 112-123

  10. Restrictive acceptance suffices for equivalence problems

    • Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Pages 124-135

  11. Grammar systems as language analyzers and recursively enumerable languages

    • Henning Bordihn, Júrgen Dassow, Gyorgy Vaszil
    Pages 136-147

  12. An interpretation of extensible objects

    • Gérard Boudol, Silvano Dal-Zilio
    Pages 148-160

  13. Modeling operating systems schedulers with multi-stack-queue grammars

    • Luca Breveglieri, Stefano Crespi Reghizzi, Alessandra Cherubini
    Pages 161-172

  14. Iterative arrays with a wee bit alternation

    • Thomas Buchholz, Andreas Klein, Martin Kutrib
    Pages 173-184

  15. Secret sharing schemes with detection of cheaters for a general access structure

    • Sergio Cabello, Carles Padró, Germán Sáez
    Pages 185-194

  16. Constructive notes on uniform and locally convex spaces

    • Luminitţa Dediu, Douglas Bridges
    Pages 195-203

  17. Graph automorphisms with maximal projection distances

    • H. N. de Ridder, H. L. Bodlaender
    Pages 204-214

  18. Kleene theorems for event-clock automata

    • Cătălin Dima
    Pages 215-225

  19. Strong iteration lemmata for regular, linear, context-free, and linear indexed languages

    • Pál Dömösi, Manfred Kudlek
    Pages 226-233

  20. Exponential output size of top-down tree transducers

    • Frank Drewes
    Pages 234-245
Back to top

Keywords

About this book

This book constitutes the refereed proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT '99, held in Iasi, Romania in August/September 1999.
The 42 revised full papers presented together with four invited papers were carefully selected from a total of 102 submissions. Among the topics addressed are abstract data types, algorithms and data structures, automata and formal languages, categorical and topological approaches, complexity, computational geometry, concurrency, cryptology, distributed computing, logics in computer science, process algebras, symbolic computation, molecular computing, quantum computing, etc.

Editors and Affiliations

  • Faculty of Computer Science, “A.I.Cuza” University, Iaşi, Romania

    Gabriel Ciobanu

  • Institute of Mathematics of the Romanian Academy, Bucharest, Romania

    Gheorghe Păun

Bibliographic Information

  • Book Title: Fundamentals of Computation Theory

  • Book Subtitle: 12th International Symposium, FCT'99 Iasi, Romania, August 30 - September 3, 1999 Proceedings

  • Editors: Gabriel Ciobanu, Gheorghe Păun

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-48321-7

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1999

  • Softcover ISBN: 978-3-540-66412-3Published: 18 August 1999

  • eBook ISBN: 978-3-540-48321-2Published: 31 July 2003

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XII, 576

  • Topics: Theory of Computation, Discrete Mathematics in Computer Science, Data Structures

Publish with us

Policies and ethics

Back to top

Search

Navigation