Fundamentals of Computation Theory International Conference FCT '89, Szeged, Hungary, August 2125, 1989. Proceedings
This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 2125, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in PoznanKornik, Poland. The papers collected in this volume are the texts o...
Other Authors:  , , 

Format:  eBook 
Language:  English 
Published: 
Berlin, Heidelberg
Springer Berlin Heidelberg
1989, 1989

Edition:  1st ed. 1989 
Series:  Lecture Notes in Computer Science

Subjects:  
Online Access:  
Collection:  Springer Book Archives 2004  Collection details see MPG.ReNa 
Table of Contents:
 Logic programming of some mathematical paradoxes
 Analysis of compact 0complete trees: A new access method to large databases
 Representation of recursively enumerable languages using alternating finite tree recognizers
 About a family of binary morphisms which stationary words are Sturmian
 On the finite degree of ambiguity of finite tree automata
 Approximation algorithms for channel assignment in cellular radio networks
 The Borel hierarchy is infinite in the class of regular sets of trees
 Parallel general prefix computations with geometric, algebraic and other applications
 Kolmogorov complexity and Hausdorff dimension
 Tree language problems in pattern recognition theory
 The computational complexity of cellular automata
 On restricted Boolean circuits
 The complexity of connectivity problems on contextfree graph languages
 Constructivity, computability, and computational complexity in analysis
 Iterated deterministic topdown lookahead
 Using generating functions to compute concurrency
 A logic for nondeterministic functional programs extended abstract
 Decision problems and Coxeter groups
 Complexity of formula classes in first order logic with functions
 Normal and sinkless Petri nets
 Descriptive and computational complexity
 The effect of nullchains on the complexity of contact schemes
 MonteCarlo inference and its relations to reliable frequency identification
 Semilinear realtime systolic trellis automata
 Inducibility of the composition of frontiertoroot tree transformations
 On oblivious branching programs of linear length
 Some timespace bounds for onetape deterministic turing machines
 Rank of rational finitely generated Wlanguages
 Extensional properties of sets of time bounded complexity (extendedabstract)
 Learning under uniform distribution
 An extended framework for default reasoning
 On word equations and Makanin's algorithm
 Complexity classes with complete problems between P and NPC
 Interpretations of synchronous flowchart schemes
 Generalized Boolean hierarchies and Boolean hierarchies over RP
 The equational logic of iterative processes
 The distributed bit complexity of the ring: From the anonymous to the nonanonymous case
 The jump number problem for biconvex graphs and rectangle covers of rectangular regions
 Recent developments in the design of asynchronous circuits
 New simulations between CRCW PRAMs
 About connections between syntactical and computational complexity
 Completeness in approximation classes
 Separating completely complexity classes related to polynomial size ?Decision trees
 On product hierarchies of automata
 On the communication complexity of planarity
 Contextfree NCE graph grammars
 Dynamic data structures with finite population: A combinatorial analysis