12. FCT 1999: Iasi, Romania

@proceedings{DBLP:conf/fct/1999,
  editor    = {Gabriel Ciobanu and
               Gheorghe Paun},
  title     = {Fundamentals of Computation Theory, 12th International Symposium,
               FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings},
  booktitle = {FCT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1684},
  year      = {1999},
  isbn      = {3-540-66412-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

• Marek Karpinski:
  Randomized Complexity of Linear Arrangements and Polyhedra. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Andrea Corradini, Reiko Heckel, Ugo Montanari:
  Tile Transition Systems as Structured Coalgebras. 13-38
  Electronic Edition (Springer LINK) BibTeX
• Arto Salomaa:
  Caesar and DNA. Views on Cryptology. 39-53
  Electronic Edition (Springer LINK) BibTeX
• Boris A. Trakhtenbrot:
  Automata and Their Interaction: Definitional Suggestions. 54-89
  Electronic Edition (Springer LINK) BibTeX
• Matthew Hennessy:
  Axiomatising Asynchronous Process Calculi (abstract). 90
  Electronic Edition (Springer LINK) BibTeX

Technical Contributions

• Cristina Bazgan, Wenceslas Fernandez de la Vega:
  A Polynomial Time Approximation Scheme for Dense MIN 2SAT. 91-99
  Electronic Edition (Springer LINK) BibTeX
• Danièle Beauquier, Anatol Slissenko:
  Decidable Classes of the Verification Problem in a Timed Predicate Logic. 100-111
  Electronic Edition (Springer LINK) BibTeX
• Viviana Bono, Michele Bugliesi:
  Interpretations of Extensible Objects and Types. 112-123
  Electronic Edition (Springer LINK) BibTeX
• Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
  Restrictive Acceptance Suffices for Equivalence Problems. 124-135
  Electronic Edition (Springer LINK) BibTeX
• Henning Bordihn, Jürgen Dassow, György Vaszil:
  Grammar Systems as Language Analyzers and Recursively Enumerable Languages. 136-147
  Electronic Edition (Springer LINK) BibTeX
• Gérard Boudol, Silvano Dal-Zilio:
  An Interpretation of Extensible Objects. 148-160
  Electronic Edition (Springer LINK) BibTeX
• Luca Breveglieri, Stefano Crespi-Reghizzi, Alessandra Cherubini:
  Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars. 161-172
  Electronic Edition (Springer LINK) BibTeX
• Thomas Buchholz, Andreas Klein, Martin Kutrib:
  Iterative Arrays with a Wee Bit Alternation. 173-184
  Electronic Edition (Springer LINK) BibTeX
• Sergio Cabello, Carles Padró, Germán Sáez:
  Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. 185-194
  Electronic Edition (Springer LINK) BibTeX
• Luminita Dediu, Douglas S. Bridges:
  Constructive Notes on Uniform and Locally Convex Spaces. 195-203
  Electronic Edition (Springer LINK) BibTeX
• H. N. de Ridder, Hans L. Bodlaender:
  Graph Automorphisms with Maximal Projection Distances. 204-214
  Electronic Edition (Springer LINK) BibTeX
• Catalin Dima:
  Kleene Theorems for Event-Clock Automata. 215-225
  Electronic Edition (Springer LINK) BibTeX
• Pál Dömösi, Manfred Kudlek:
  Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. 226-233
  Electronic Edition (Springer LINK) BibTeX
• Frank Drewes:
  Exponential Output Size of Top-Down Tree Transducers. 234-245
  Electronic Edition (Springer LINK) BibTeX
• Manfred Droste, Dietrich Kuske:
  On Recognizable Languages in Divisibility Monoids. 246-257
  Electronic Edition (Springer LINK) BibTeX
• Cristian Ene, Traian Muntean:
  Expressiveness of Point-to-Point versus Broadcast Communications. 258-268
  Electronic Edition (Springer LINK) BibTeX
• Jürgen Forster:
  On Relative Loss Bounds in Generalized Linear Regression. 269-280
  Electronic Edition (Springer LINK) BibTeX
• Rudolf Freund:
  Generalized P-Systems. 281-292
  Electronic Edition (Springer LINK) BibTeX
• Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis:
  Optimal, Distributed Decision-Making: The Case of No Communication. 293-303
  Electronic Edition (Springer LINK) BibTeX
• Vesa Halava, Tero Harju, Mika Hirvensalo:
  Generalized PCP Is Decidable for Marked Morphisms. 304-315
  Electronic Edition (Springer LINK) BibTeX
• Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai:
  On Time-Constructible Functions in One-Dimensional Cellular Automata. 316-326
  Electronic Edition (Springer LINK) BibTeX
• Laurent Juban:
  Dichotomy Theorem for the Generalized Unique Satisfiability Problem. 327-337
  Electronic Edition (Springer LINK) BibTeX
• H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy:
  A General Categorical Connection between Local Event Structures and Local Traces. 338-349
  Electronic Edition (Springer LINK) BibTeX
• Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Stefan Taubenberger:
  Correct Translation of Mutually Recursive Function Systems into TOL Collage Grammars. 350-361
  Electronic Edition (Springer LINK) BibTeX
• Teodor Knapik, Étienne Payet:
  Synchronized Product of Linear Bounded Machines. 362-373
  Electronic Edition (Springer LINK) BibTeX
• Roman M. Kolpakov, Gregory Kucherov:
  On Maximal Repetitions in Words. 374-385
  Electronic Edition (Springer LINK) BibTeX
• Dorel Lucanu:
  Axiomatization of the Coherence Property for Categories of Symmetries. 386-397
  Electronic Edition (Springer LINK) BibTeX
• Carlos Martín-Vide, Alexandru Mateescu:
  Sewing Grammars. 398-408
  Electronic Edition (Springer LINK) BibTeX
• Andrei Paun, Mihaela Paun:
  State and Transition Complexity of Watson-Crick Finite Automata. 409-420
  Electronic Edition (Springer LINK) BibTeX
• Catherine Pilière:
  A Confluence Result for a Typed lambda-Calculus of Exception Handling with Fixed-Point. 421-432
  Electronic Edition (Springer LINK) BibTeX
• Adriana Popovici, Dan Popovici:
  delta-Uniformly Decidable Sets and Turing Machines. 433-440
  Electronic Edition (Springer LINK) BibTeX
• Klaus Reinhardt:
  A Parallel Context-Free Derivation Hierarchy. 441-450
  Electronic Edition (Springer LINK) BibTeX
• Isabelle Ryl, Yves Roos, Mireille Clerbout:
  Generalized Synchronization Languages. 451-462
  Electronic Edition (Springer LINK) BibTeX
• Klaus-Dieter Schewe, Bernhard Thalheim:
  A Generalization of Dijkstra's Calculus to Typed Program Specifications. 463-474
  Electronic Edition (Springer LINK) BibTeX
• Franck Seynhaeve, Sophie Tison, Marc Tommasi:
  Homomorphisms and Concurrent Term Rewriting. 475-487
  Electronic Edition (Springer LINK) BibTeX
• Jeffrey Shallit, Ming-wei Wang:
  On Two-Sided Infinite Fixed Points of Morphisms. 488-499
  Electronic Edition (Springer LINK) BibTeX
• Jonathan P. Sharp:
  Tiling Multi-dimensional Arrays. 500-511
  Electronic Edition (Springer LINK) BibTeX
• Viorica Sofronie-Stokkermans, Karel Stokkermans:
  Modeling Interaction by Sheaves and Geometric Logic. 512-523
  Electronic Edition (Springer LINK) BibTeX
• Holger Spakowski, Jörg Vogel:
  The Operators minCh and maxCh on the Polynomial Hierarchy. 524-535
  Electronic Edition (Springer LINK) BibTeX
• Ludwig Staiger:
  The Kolmogorov Complexity of Real Numbers. 536-546
  Electronic Edition (Springer LINK) BibTeX
• Irina Virbitskaite, E. Pokozy:
  A Partial Order Method for the Verification of Time Petri Nets. 547-558
  Electronic Edition (Springer LINK) BibTeX
• Janez Zerovnik:
  Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs. 559-568
  Electronic Edition (Springer LINK) BibTeX