Fundamentals of Computation Theory (Record no. 33831)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04479nam a22004335i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783540387657 |
| -- | 978-3-540-38765-7 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| 245 10 - TITLE STATEMENT | |
| Title | Fundamentals of Computation Theory |
| Sub Title | Proceedings of the 1981 International FCT-Conference, Szeged, Hungary August 24–28, 1981 / |
| Statement of responsibility, etc | edited by Ferenc Gécseg. |
| 260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Berlin, Heidelberg : |
| Name of publisher | Springer Berlin Heidelberg, |
| Year of publication | 1981. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XI, 474 p. |
| Other physical details | online resource. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Observability 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer science. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computation by Abstract Devices. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Gécseg, Ferenc. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/3-540-10854-8 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | E-BOOKS |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 1981. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Accession Number | Uniform Resource Identifier | Koha item type |
|---|---|---|---|---|---|---|---|
| IMSc Library | EBK4537 | http://dx.doi.org/10.1007/3-540-10854-8 | E-BOOKS |