000 05331nam a22006015i 4500
001 978-3-540-69529-5
003 DE-He213
005 20240423132519.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540695295
_9978-3-540-69529-5
024 7 _a10.1007/BFb0036167
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFundamentals of Computation Theory
_h[electronic resource] :
_b11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997. Proceedings /
_cedited by Bogdan S. Chlebus, Ludwik Czaja.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aXII, 484 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1279
505 0 _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 Dycklanguage -- 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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aComputer graphics.
650 0 _aArtificial intelligence
_xData processing.
650 1 4 _aTheory of Computation.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Graphics.
650 2 4 _aData Science.
700 1 _aChlebus, Bogdan S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aCzaja, Ludwik.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540633860
776 0 8 _iPrinted edition:
_z9783662204429
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1279
856 4 0 _uhttps://doi.org/10.1007/BFb0036167
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188581
_d188581