LEADER 05726nam 22006615 450 001 9910144919303321 005 20200706022752.0 010 $a3-540-69529-X 024 7 $a10.1007/BFb0036167 035 $a(CKB)1000000000234697 035 $a(SSID)ssj0000323383 035 $a(PQKBManifestationID)11250814 035 $a(PQKBTitleCode)TC0000323383 035 $a(PQKBWorkID)10312576 035 $a(PQKB)10088361 035 $a(DE-He213)978-3-540-69529-5 035 $a(PPN)155225324 035 $a(EXLCZ)991000000000234697 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFundamentals of Computation Theory$b[electronic resource] $e11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997. Proceedings /$fedited by Bogdan S. Chlebus, Ludwik Czaja 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (XII, 484 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1279 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-63386-3 327 $aThe complexity class ? p 2 : Recent results and applications in AI and modal logic -- Proof systems for structured algebraic specifications: An overview -- Average-case analysis via incompressibility -- Locally computable enumerations -- The complexity of error-correcting codes -- Stochastic analysis of dynamic processes -- k-k Sorting on the multi-mesh -- Refinement of coloured petri nets -- Stratified petri nets -- Distributed acyclic orientation of asynchronous anonymous networks -- Generalized rational relations and their logical definability -- A note on broadcasting with linearly bounded transmission faults in constant degree networks -- Logics which capture complexity classes over the reals -- Criteria to disprove context-freeness of collage languages -- The subword complexity of fixed points of binary uniform morphisms -- Efficient parallel computing with memory faults -- Bounded concurrency -- Concerning the time bounds of existing shortest watchman route algorithms -- Query order in the polynomial hierarchy -- Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria -- Pattern-matching problems for 2-dimensional images described by finite automata -- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups -- Contextual grammars with distributed catenation and shuffle -- A two-dimensional hierarchy for attributed tree transducers -- Synchronization of 1-way connected processors -- A linear-time heuristic for minimum rectangular coverings (Extended abstract) -- On occurrence net semantics for petri nets with contacts -- Cellular automata universality revisited -- Trade-off results for connection management -- On the average complexity of the membership problem for a generalized Dyck language -- Towards optimal locality in mesh-indexings -- On the hierarchy of nondeterministic branching k-programs -- FDT is undecidable for finitely presented monoids with solvable word problems -- The equivalence of pebbles and sensing heads for finite automata -- From finite automata toward hybrid systems (Extended abstract) -- On an optimal quantified propositional proof system nal proof system and a complete language for NP ? co-NP for NP ? co-NP -- Lower bounds in on-line geometric searching metric searching -- The complexity of universal text-learners -- Unique normal forms for nonlinear term rewriting systems: Root overlaps -- Behavioural characterizations of partial order logics. 330 $aThis book constitutes the refereed proceedings of the 11th International Symposium on Fundamentals of Computer Theory, FCT'97, held in Krakow, Poland, in September 1997. The 34 revised full papers presented in the volume were selected from a total of 72 submissions. Also included are six invited papers by leading scientists. The papers address a variety of current topics in theoretical computer science including models of computation, concurrency, algorithms, complexity theory, programming theory, formal languages, graph theory and discrete mathematics, networking, automata theory, term rewriting, etc. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1279 606 $aComputers 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aData structures (Computer science) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputers. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 0$aData structures (Computer science) 615 14$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aData Structures. 676 $a004 702 $aChlebus$b Bogdan S$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCzaja$b Ludwik$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFCT '97 906 $aBOOK 912 $a9910144919303321 996 $aFundamentals of Computation Theory$92557870 997 $aUNINA