LEADER 06999nam 22007575 450 001 996465726903316 005 20200702021228.0 010 $a3-540-48180-X 024 7 $a10.1007/3-540-51498-8 035 $a(CKB)1000000000233432 035 $a(SSID)ssj0000323388 035 $a(PQKBManifestationID)11242466 035 $a(PQKBTitleCode)TC0000323388 035 $a(PQKBWorkID)10299293 035 $a(PQKB)11050469 035 $a(DE-He213)978-3-540-48180-5 035 $a(PPN)15516855X 035 $a(EXLCZ)991000000000233432 100 $a20121227d1989 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFundamentals of Computation Theory$b[electronic resource] $eInternational Conference FCT '89, Szeged, Hungary, August 21-25, 1989. Proceedings /$fedited by Janos Csirik, Ferenc Gecseg, Janos Demetrovics 205 $a1st ed. 1989. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1989. 215 $a1 online resource (XIV, 498 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v380 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-51498-8 327 $aOn 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. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v380 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aMathematical logic 606 $aMicroprogramming  606 $aCombinatorics 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aControl Structures and Microprogramming$3https://scigraph.springernature.com/ontologies/product-market-codes/I12018 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aMicroprogramming . 615 0$aCombinatorics. 615 14$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aControl Structures and Microprogramming. 615 24$aCombinatorics. 676 $a004.0151 702 $aCsirik$b Janos$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGecseg$b Ferenc$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDemetrovics$b Janos$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465726903316 996 $aFundamentals of computation theory$9382778 997 $aUNISA