Fundamentals of Computation Theory

12th International Symposium, FCT’99 Iaşi, Romania, August 30 - September 3, 1999 Proceedings

  • Gabriel Ciobanu
  • Gheorghe Păun
Conference proceedings FCT 1999

DOI: 10.1007/3-540-48321-7

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

Table of contents (47 papers)

  1. Front Matter
    Pages I-XI
  2. Tile transition systems as structured coalgebras?
    Andrea Corradini, Reiko Heckel, Ugo Montanari
    Pages 13-38
  3. Caesar and DNA — views on cryptology
    Arto Salomaa
    Pages 39-53
  4. Axiomatising asynchronous process calculi
    Matthew Hennessy
    Pages 90-90
  5. A polynomial time approximation scheme for dense MupIN 2S{upAT}
    Cristina Bazgan, W. de la Fernandez Vega
    Pages 91-99
  6. Decidable classes of the verification problem in a timed predicate logic
    Danièle Beauquier, Anatol Slissenko
    Pages 100-111
  7. Interpretations of extensible objects and types
    Viviana Bono, Michele Bugliesi
    Pages 112-123
  8. Restrictive acceptance suffices for equivalence problems
    Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Pages 124-135
  9. Grammar systems as language analyzers and recursively enumerable languages
    Henning Bordihn, Júrgen Dassow, Gyorgy Vaszil
    Pages 136-147
  10. An interpretation of extensible objects
    Gérard Boudol, Silvano Dal-Zilio
    Pages 148-160
  11. Modeling operating systems schedulers with multi-stack-queue grammars
    Luca Breveglieri, Stefano Crespi Reghizzi, Alessandra Cherubini
    Pages 161-172
  12. Iterative arrays with a wee bit alternation
    Thomas Buchholz, Andreas Klein, Martin Kutrib
    Pages 173-184
  13. Secret sharing schemes with detection of cheaters for a general access structure
    Sergio Cabello, Carles Padró, Germán Sáez
    Pages 185-194
  14. Constructive notes on uniform and locally convex spaces
    Luminitţa Dediu, Douglas Bridges
    Pages 195-203
  15. Graph automorphisms with maximal projection distances
    H. N. de Ridder, H. L. Bodlaender
    Pages 204-214
  16. Kleene theorems for event-clock automata
    Cătălin Dima
    Pages 215-225

About these proceedings


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.


Automat algorithms automata complexity computational geometry computer computer science data structures distributed computing formal language formal languages

Editors and affiliations

  • Gabriel Ciobanu
    • 1
  • Gheorghe Păun
    • 2
  1. 1.Faculty of Computer Science“A.I.Cuza” UniversityIaşiRomania
  2. 2.Institute of Mathematics of the Romanian AcademyBucharestRomania

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66412-3
  • Online ISBN 978-3-540-48321-2
  • Series Print ISSN 0302-9743