06999nam 22007575 450 99646572690331620200702021228.03-540-48180-X10.1007/3-540-51498-8(CKB)1000000000233432(SSID)ssj0000323388(PQKBManifestationID)11242466(PQKBTitleCode)TC0000323388(PQKBWorkID)10299293(PQKB)11050469(DE-He213)978-3-540-48180-5(PPN)15516855X(EXLCZ)99100000000023343220121227d1989 u| 0engurnn|008mamaatxtccrFundamentals of Computation Theory[electronic resource] International Conference FCT '89, Szeged, Hungary, August 21-25, 1989. Proceedings /edited by Janos Csirik, Ferenc Gecseg, Janos Demetrovics1st ed. 1989.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1989.1 online resource (XIV, 498 p.) Lecture Notes in Computer Science,0302-9743 ;380Bibliographic Level Mode of Issuance: Monograph3-540-51498-8 On word equations and Makanin's algorithm -- Complexity classes with complete problems between P and NP-C -- 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 non-anonymous 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 -- Context-free NCE graph grammars -- Dynamic data structures with finite population: A combinatorial analysis -- Iterated deterministic top-down look-ahead -- 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 null-chains on the complexity of contact schemes -- Monte-Carlo inference and its relations to reliable frequency identification -- Semilinear real-time systolic trellis automata -- Inducibility of the composition of frontier-to-root tree transformations -- On oblivious branching programs of linear length -- Some time-space bounds for one-tape deterministic turing machines -- Rank of rational finitely generated W-languages -- Extensional properties of sets of time bounded complexity (extended abstract) -- Learning under uniform distribution -- An extended framework for default reasoning -- Logic programming of some mathematical paradoxes -- Analysis of compact 0-complete 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 context-free graph languages -- Constructivity, computability, and computational complexity in analysis.This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds.Lecture Notes in Computer Science,0302-9743 ;380ComputersAlgorithmsComputer logicMathematical logicMicroprogramming CombinatoricsComputation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Control Structures and Microprogramminghttps://scigraph.springernature.com/ontologies/product-market-codes/I12018Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Computers.Algorithms.Computer logic.Mathematical logic.Microprogramming .Combinatorics.Computation by Abstract Devices.Algorithm Analysis and Problem Complexity.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.Control Structures and Microprogramming.Combinatorics.004.0151Csirik Janosedthttp://id.loc.gov/vocabulary/relators/edtGecseg Ferencedthttp://id.loc.gov/vocabulary/relators/edtDemetrovics Janosedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465726903316Fundamentals of computation theory382778UNISA