- Andrei Paun, Mihaela Paun:
State and Transition Complexity of Watson-Crick Finite Automata. FCT 1999: 409-420 - Catherine Pilière:
A Confluence Result for a Typed lambda-Calculus of Exception Handling with Fixed-Point. FCT 1999: 421-432 - Adriana Popovici, Dan Popovici:
delta-Uniformly Decidable Sets and Turing Machines. FCT 1999: 433-440 - Klaus Reinhardt:
A Parallel Context-Free Derivation Hierarchy. FCT 1999: 441-450 - H. N. de Ridder, Hans L. Bodlaender:
Graph Automorphisms with Maximal Projection Distances. FCT 1999: 204-214 - Isabelle Ryl, Yves Roos
, Mireille Clerbout:
Generalized Synchronization Languages. FCT 1999: 451-462 - Arto Salomaa:
Caesar and DNA. Views on Cryptology. FCT 1999: 39-53 - Klaus-Dieter Schewe, Bernhard Thalheim
:
A Generalization of Dijkstra's Calculus to Typed Program Specifications. FCT 1999: 463-474 - Franck Seynhaeve, Sophie Tison
, Marc Tommasi:
Homomorphisms and Concurrent Term Rewriting. FCT 1999: 475-487 - Jeffrey O. Shallit, Ming-wei Wang:
On Two-Sided Infinite Fixed Points of Morphisms. FCT 1999: 488-499 - Jonathan Paul Sharp:
Tiling Multi-dimensional Arrays. FCT 1999: 500-511 - Viorica Sofronie-Stokkermans, Karel Stokkermans:
Modeling Interaction by Sheaves and Geometric Logic. FCT 1999: 512-523 - Holger Spakowski, Jörg Vogel:
The Operators minCh and maxCh on the Polynomial Hierarchy. FCT 1999: 524-535 - Ludwig Staiger
:
The Kolmogorov Complexity of Real Numbers. FCT 1999: 536-546 - Boris A. Trakhtenbrot:
Automata and Their Interaction: Definitional Suggestions. FCT 1999: 54-89 - Irina B. Virbitskaite, E. Pokozy:
A Partial Order Method for the Verification of Time Petri Nets. FCT 1999: 547-558 - Janez Zerovnik
:
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs. FCT 1999: 559-568 - Gabriel Ciobanu
, Gheorghe Paun:
Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings. Lecture Notes in Computer Science 1684, Springer 1999, ISBN 3-540-66412-2 [contents]