9. FCT 1993: Szeged, Hungary

@proceedings{DBLP:conf/fct/1993,
  editor    = {Zolt{\'a}n {\'E}sik},
  title     = {Fundamentals of Computation Theory, 9th International Symposium,
               FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings},
  booktitle = {FCT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {710},
  year      = {1993},
  isbn      = {3-540-57163-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

• Volker Diekert:
  Rewriting, Möbius Functions and Semi-Commutations. 1-15
  
• Martin Dietzfelbinger:
  Simulations Between Different Models of Parallel Computers. 16-30
  
• Masami Ito:
  Dense and Disjunctive Properties of Languages. 31-49
  
• Helmut Jürgensen, Stavros Konstantinidis:
  The Hierarchy of Codes. 50-68
  
• Hans-Jörg Kreowski:
  Five Facets of Hyperedge Replacement Beyond Context-Freeness. 69-86
  
• Robin Milner:
  An Action Structure for Synchronous pi-Calculus. 87-105
  
• Pavel Pudlák:
  AC⁰ Circuit Complexity. 106-120
  
• Arto Salomaa:
  Pattern Languages: Problems of Decidability and Generation. 121-132
  

Communications

• Habib Abdulrab, Marianne Maksimenko:
  General Solution of Mirror Equation. 133-141
  
• Yves Andre, Francis Bossut:
  Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers. 142-151
  
• Jan A. Bergstra, Gheorghe Stefanescu:
  Translations Between Flowchart Schemes and Process Graphs. 152-161
  
• Virgil Emil Cazanescu:
  Local Equational Logic. 162-170
  
• Piotr Chrzastowski-Wachtel, Marek Raczunas:
  Liveness of Weighted Circuits and the Diophantine Problem of Frobenius. 171-180
  
• Bruno Courcelle:
  Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement. 181-193
  
• Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura:
  Formal Languages Consisting of Primitive Words. 194-203
  
• Bruno Durand:
  Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof. 204-211
  
• Jürgen Ebert:
  Efficient Interpretation of State Charts. 212-221
  
• Heinz Faßbender:
  Implementation of a Universal Unification Algorithm for Macro Tree Transducers. 222-233
  
• Paul Fischer:
  Finding Maximum Convex Polygons. 234-243
  
• Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak:
  Approximations with Axis-Aligned Rectangles (Extended Abstract). 244-255
  
• Mahesh Girkar, Robert Moll:
  Vector Sequence Analysis and Full Weak Safety for Concurrent Systems. 256-265
  
• Hans Dietmar Gröger:
  Does Transitivity Help? On the Complexity of Poset Properties. 266-278
  
• Torben Hagerup, Martin Maas:
  Generalized Topological Sorting in Linear Time. 279-288
  
• Lane A. Hemachandra, Riccardo Silvestri:
  Easity Checked Self-Reducibility (Extended Abstract). 289-298
  
• Markus Holzer, Klaus-Jörn Lange:
  On the Complexities of Linear LL(1) and LR(1) Grammars. 299-308
  
• Dang Van Hung, Tran Van Dung:
  On the Relation Between Firing Sequences and Processes of Petri Nets. 309-318
  
• Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger:
  Maximum Covering with D Cliques. 319-328
  
• Rainer Kemp:
  Monotonically Labelled Ordered Trees and Multidimensional Binary Trees. 329-341
  
• Sabine Kuske:
  A Maximum Path Length Pumping Lemma for Edge-Replacement Languages. 342-351
  
• Robert S. Maier, René Schott:
  Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions. 352-362
  
• Ernest G. Manes:
  The Equational Theory of a Boolean Monad. 363-374
  
• Maurice Margenstern:
  Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. 375-385
  
• Alexandru Mateescu:
  On Scattered Syntactic Monoids. 386-395
  
• Andreas Potthoff, Wolfgang Thomas:
  Regular Tree Languages Without Unary Symbols are Star-Free. 396-405
  
• Zsuzsanna Róka:
  One-way Cellular Automata on Cayley Graphs. 406-417
  
• Peter Ruzicka, Igor Prívara:
  On Tree Pattern Unification Problems. 418-429
  
• Kai Salomaa, Derick Wood, Sheng Yu:
  Structural Equivalences and ET0L Grammars (Extended Abstract). 430-439
  
• Giora Slutzki, Sándor Vágvölgyi:
  A Hierarchy of Deterministic Top-down Tree Transformations. 440-451
  
• Hongzhong Wu:
  Synthesis of O(lg n) Testable Trees. 452-461
  
• Jilei Yin, Zhu Hong:
  On the Learnability of a Restricted Predicate Formulae. 462-471
  

Last update Tue Feb 14 03:55:54 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page