7. FCT 1989:
Szeged,
Hungary
János Csirik, János Demetrovics, Ferenc Gécseg (Eds.):
Fundamentals of Computation Theory, International Conference FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings.
Lecture Notes in Computer Science 380 Springer 1989, ISBN 3-540-51498-8 
@proceedings{DBLP:conf/fct/1989,
editor = {J{\'a}nos Csirik and
J{\'a}nos Demetrovics and
Ferenc G{\'e}cseg},
title = {Fundamentals of Computation Theory, International Conference
FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings},
booktitle = {FCT},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {380},
year = {1989},
isbn = {3-540-51498-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Habib Abdulrab, Jean-Pierre Pécuchet:
On Word Equations and Makanin's Algorithm.
1-12
- Carme Àlvarez, Josep Díaz, Jacobo Torán:
Complexity Classes with Complete Problems Between P and NP-C.
13-24
- Miklós Bartha:
Interpretations of Synchronous Flowchart Schemes.
25-34
- Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
35-46
- Stephen L. Bloom:
The Equational Logic of Iterative Processes.
47-57
- Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth:
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case.
58-67
- Andreas Brandstädt:
The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions.
68-77
- Janusz A. Brzozowski, Jo C. Ebergen:
Recent Developments in the Design of Asynchronous Circuits.
78-94
- Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
New Simulations between CRCW PRAMs.
95-104
- Jean-Luc Coquidé, Max Dauchet, Sophie Tison:
About Connections Between Syntactical and Computational Complexity.
105-115
- Pierluigi Crescenzi, Alessandro Panconesi:
Completeness in Approximation Classes.
116-126
- Carsten Damm, Christoph Meinel:
Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees.
127-136
- Pál Dömösi, Zoltán Ésik, Balázs Imreh:
On Product Hierarchies of Automata.
137-144
- Pavol Duris, Pavel Pudlák:
On the Communication Complexity of Planarity.
145-147
- Joost Engelfriet:
Context-Free NCE Graph Grammars.
148-161
- Jean Françon, B. Randrianarimanana, René Schott:
Dynamic Data Structures with Finite Population: A Combinatorial Analysis.
162-174
- Zoltán Fülöp, Sándor Vágvölgyi:
Iterated Deterministic Top-Down Look-Ahead.
175-184
- Dominique Geniet, Loÿs Thimonier:
Using Generating Functions to Compute Concurrency.
185-196
- Ana Gil-Luezas:
A Logic for Nondeterministic Functional Programs (Extended Abstract).
197-208
- Bernd Graw:
Decision Problems and Coxeter Groups.
209-223
- Erich Grädel:
Complexity of Formula Classes in First Order Logic with Functions.
224-233
- Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen:
Normal and Sinkless Petri Nets.
234-243
- Neil Immerman:
Descriptive and Computational Complexity.
244-245
- Stasys Jukna:
The Effect of Null-Chains on the Complexity of Contact Schemes.
246-256
- Efim B. Kinber, Thomas Zeugmann:
Monte-Carlo Inference and Its Relations to Reliable Frequency Identification.
257-266
- Ivan Korec:
Semilinear Real-Time Systolic Trellis Automata.
267-276
- Tibor Kovács:
Inducibility of the Composition of Frontier-to-Root Tree Transformations.
277-286
- Matthias Krause, Stephan Waack:
On Oblivious Branching Programs of Linear Length (Extended Abstract).
287-296
- Maciej Liskiewicz, Krzysztof Lorys:
Some Time-Space Bounds for One-Tape Deterministic Turing Machines.
297-307
- Igor Litovsky:
Rank of Rational Finitely Generated W-Languages.
308-317
- Wolfgang Maass, Theodore A. Slaman:
Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract).
318-326
- Alberto Marchetti-Spaccamela, Marco Protasi:
Learning Under Uniform Distribution.
327-338
- M. A. Nait Abdallah:
An Extended Framework for Default Reasoning.
339-348
- M. A. Nait Abdallah:
Logic Programming of Some Mathematical Paradoxes.
349-361
- Ratko Orlandic, John L. Pfaltz:
Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases.
362-371
- Kai Salomaa:
Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers.
372-383
- Patrice Séébold:
About a Family of Binary Morphisms which Stationary Words are Sturmian.
384-394
- Helmut Seidl:
On the Finite Degree of Ambiguity of Finite Tree Automata.
395-404
- Hans-Ulrich Simon:
Approximation Algorithms for Channel Assignment in Cellular Radio Networks.
405-415
- Jerzy Skurczynski:
The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees.
416-423
- Frederick N. Springsteel, Ivan Stojmenovic:
Parallel General Prefix Computations with Geometric, Algebraic and Other Applications.
424-433
- Ludwig Staiger:
Kolmogorov Complexity and Hausdorff Dimension.
434-443
- Magnus Steinby:
Tree Language Problems in Pattern Recognition Theory (Extended Abstract).
444-450
- Klaus Sutner:
The Computational Complexity of Cellular Automata.
451-459
- György Turán:
On Restricted Boolean Circuits.
460-469
- Egon Wanke:
The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract).
470-479
- Klaus Weihrauch:
Constructivity, Computability, and Computational Complexity in Analysis.
480-493
Last update Fri May 25 08:14:02 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
