LEADER 04989nam 22005535 450 001 996465515903316 005 20200701194059.0 010 $a3-540-38765-X 024 7 $a10.1007/3-540-10854-8 035 $a(CKB)1000000000230125 035 $a(SSID)ssj0000323386 035 $a(PQKBManifestationID)11243652 035 $a(PQKBTitleCode)TC0000323386 035 $a(PQKBWorkID)10300005 035 $a(PQKB)10827840 035 $a(DE-He213)978-3-540-38765-7 035 $a(PPN)155183397 035 $a(EXLCZ)991000000000230125 100 $a20121227d1981 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFundamentals of Computation Theory$b[electronic resource] $eProceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981 /$fedited by F. Gecseg 205 $a1st ed. 1981. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1981. 215 $a1 online resource (XI, 474 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v117 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-10854-8 327 $aObservability and Nerode equivalence in concrete categories -- Some universal algebraic and model theoretic results in computer science -- Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems -- Moderately exponential bound for graph isomorphism -- An algebraic definition of attributed transformations -- Analogies of PAL and COPY -- Quasi-equational logic for partial algeras -- Homogeneity and completeness -- On the error correcting power of pluralism in inductive inference -- Equality languages and language families -- Extremal combinatorial problems in relational data base -- Specifying algebraic data types by domain equations -- An axiomatization of regular forests in the language of algebraic theories with iteration -- Fast recognition of rings and lattices -- A definition of the P = NP-problem in categories -- Generating graph languages using hypergraph grammars -- Lower bounds for problems defined by polynomial inequalities -- What is computable for abstract data types ? -- On strongly cube-free ?-words generated by binary morphisms -- On the role of selectors in selective substitution grammars -- Classes of functions over binary trees -- Mathematical structures underlying greedy algorithms -- Some properties of language families generated by commutative languages -- Isomorphism completeness for some algebraic structures -- Reducing algebraic tree grammars -- Rational cone and substitution -- On the regularity problem of SF-languages generated by minimal linear grammars -- Co-algebras as machines for the interpretations of flow diagrams -- Random access machines and straight-line programs -- On the LBA problem -- Dynamic algebras of programs -- The equivalence problem for LL- and LR-regular grammars -- Context-free languages of infinite words as least fixpoints -- Remarks on the notion of concurrency relation in the case of systems -- On the size of conjunctive representations of n-ary relations -- On subwords of formal languages -- First order dynamic logic with decidable proofs and workable model theory -- Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures -- Processes in Petri nets -- Some algebraic aspects of recognizability and rationality -- Pebbling and bandwidth -- On cellular graph-automata and second-order definable graph-properties -- Extensions of symmetric hom-functors to the Kleisli category -- A new operation between languages -- Logical description of computation processes -- An algorithm to identify slices, with applications to vector replacement systems -- One pebble does not suffice to search plane labyrinths -- About the by codings of environments induced posets [µ z, ?] and [?z, ?] -- The complexity of automata and subtheories of monadic second order arithmetics -- Tape complexity of word problems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v117 606 $aMathematics 606 $aComputers 606 $aMathematics, general$3https://scigraph.springernature.com/ontologies/product-market-codes/M00009 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 615 0$aMathematics. 615 0$aComputers. 615 14$aMathematics, general. 615 24$aComputation by Abstract Devices. 615 24$aTheory of Computation. 676 $a510 702 $aGecseg$b F$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465515903316 996 $aFundamentals of computation theory$9382778 997 $aUNISA