Fundamentals of computation theory : International Conference FCT '89 Szeged, Hungary, August 21 25, 1989 : proceedings
This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts o...
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
380 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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, International conference FCT '89, Szeged, Hungary, August 21-25, 1989, Berlin, Springer-Verlag, 1989, 1 vol. (XI-493 p.), Lecture notes in computer science, 3-540-51498-8 • Fundamentals of Computation Theory, Texte imprimé, 9783662170342 |
| LEADER | 06397nam a22004577a 4500 | ||
|---|---|---|---|
| 001 | 943923 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15516855X | ||
| 020 | |a 9783540481805 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International FCT-Conference |n (07 |d :1989 |c :Szeged, Hongrie). | |
| 245 | 1 | 0 | |a Fundamentals of computation theory : |b International Conference FCT '89 Szeged, Hungary, August 21 25, 1989 : proceedings |c [edited by] J. Csirik, J. Demetrovics, F. 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 380 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a On word equations and Makanin's algorithm -- Complexity classes with complete problems between P and NP-C -- Interpretations of synchronous flowchart schemes -- Generalized Boolean hierarchies and Boolean hierarchies over RP -- The equational logic of iterative processes -- The distributed bit complexity of the ring: From the anonymous to the non-anonymous case -- The jump number problem for biconvex graphs and rectangle covers of rectangular regions -- Recent developments in the design of asynchronous circuits -- New simulations between CRCW PRAMs -- About connections between syntactical and computational complexity -- Completeness in approximation classes -- Separating completely complexity classes related to polynomial size ?-Decision trees -- On product hierarchies of automata -- On the communication complexity of planarity -- Context-free NCE graph grammars -- Dynamic data structures with finite population: A combinatorial analysis -- Iterated deterministic top-down look-ahead -- Using generating functions to compute concurrency -- A logic for nondeterministic functional programs extended abstract -- Decision problems and Coxeter groups -- Complexity of formula classes in first order logic with functions -- Normal and sinkless Petri nets -- Descriptive and computational complexity -- The effect of null-chains on the complexity of contact schemes -- Monte-Carlo inference and its relations to reliable frequency identification -- Semilinear real-time systolic trellis automata -- Inducibility of the composition of frontier-to-root tree transformations -- On oblivious branching programs of linear length -- Some time-space bounds for one-tape deterministic turing machines -- Rank of rational finitely generated W-languages -- Extensional properties of sets of time bounded complexity (extendedabstract) -- Learning under uniform distribution -- An extended framework for default reasoning -- Logic programming of some mathematical paradoxes -- Analysis of compact 0-complete trees: A new access method to large databases -- Representation of recursively enumerable languages using alternating finite tree recognizers -- About a family of binary morphisms which stationary words are Sturmian -- On the finite degree of ambiguity of finite tree automata -- Approximation algorithms for channel assignment in cellular radio networks -- The Borel hierarchy is infinite in the class of regular sets of trees -- Parallel general prefix computations with geometric, algebraic and other applications -- Kolmogorov complexity and Hausdorff dimension -- Tree language problems in pattern recognition theory -- The computational complexity of cellular automata -- On restricted Boolean circuits -- The complexity of connectivity problems on context-free graph languages -- Constructivity, computability, and computational complexity in analysis. | |
| 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 | ||
| 520 | |a This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Mathématiques | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Microprogrammation | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Csirik, János. |4 pbd | |
| 700 | 1 | |a Demetrovics, János. |4 pbd | |
| 700 | 1 | |a Gécseg, Ferenc. |4 pbd | |
| 776 | 0 | |0 021226555 |t Fundamentals of computation theory |o proceedings |f International conference FCT '89, Szeged, Hungary, August 21-25, 1989 |c Berlin |n Springer-Verlag |d 1989 |p 1 vol. (XI-493 p.) |s Lecture notes in computer science |z 3-540-51498-8 | |
| 776 | 0 | |t Fundamentals of Computation Theory |b Texte imprimé |z 9783662170342 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-51498-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-WDBKBS1T-N |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747924473 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-51498-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750936649 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-51498-8 |z Accès INSA CVL | |
| 997 | |0 943923 |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/ | ||