Fundamentals of computation theory : proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
117 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Fundamentals of computation theory, proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, edited by Ferenc Gécseg, Berlin, Springer-Verlag, 1981, 1 vol. (X-471 p.), Lecture notes in computer science, 3-540-10854-8 • Fundamentals of Computation Theory, Texte imprimé, 9783662167472 |
| LEADER | 05256nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 944309 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155183397 | ||
| 020 | |a 9783540387657 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 511 | ||
| 111 | 2 | |a International FCT-Conference |n (03 |d :1981 |c :Szeged, Hongrie). | |
| 245 | 1 | 0 | |a Fundamentals of computation theory : |b proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981 |c edited by Ferenc Gécseg. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 117 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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 infinitewords 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Automates mathématiques, Théorie des | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Gécseg, Ferenc. |4 pbd | |
| 776 | 0 | |0 024321982 |t Fundamentals of computation theory |o proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981 |f edited by Ferenc Gécseg |c Berlin |n Springer-Verlag |d 1981 |p 1 vol. (X-471 p.) |s Lecture notes in computer science |z 3-540-10854-8 | |
| 776 | 0 | |t Fundamentals of Computation Theory |b Texte imprimé |z 9783662167472 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-10854-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-4MT56DXR-W |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747920885 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-10854-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750933321 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-10854-8 |z Accès INSA CVL | |
| 997 | |0 944309 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||