Fundamentals of computation theory : FCT '85 Cottbus, GDR, September 9 13, 1985
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
199 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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, FCT '85, Cottbus, GDR, September 9-13, 1985, edited by Lothar Budach, 1985, Berlin, Springer-Verlag, 1 vol. (XII-542 p.), Lecture notes in computer science, 3-540-15689-5 • Fundamentals of Computation Theory, Texte imprimé, 9783662179901 |
| LEADER | 05275nam a22003737a 4500 | ||
|---|---|---|---|
| 001 | 944323 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155183745 | ||
| 020 | |a 9783540396369 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Conference on fundamentals of computation theory |n (05 |d :1985 |c :Cottbus). | |
| 245 | 1 | 0 | |a Fundamentals of computation theory : |b FCT '85 Cottbus, GDR, September 9 13, 1985 |c edited by Lothar Budach. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 199 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Space complexity of alternating Turing machines -- A unifying theorem for algebraic semantics and dynamic logics -- On some "non-uniform" complexity measures -- Fast parallel vertex colouring -- Muller automata and bi-infinite words -- On formal languages, probabilities, paging and decoding algorithms -- On the restriction of some NP-complete graph problems to permutation graphs -- Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic -- Algorithms solving path systems -- Decidability of confluence for ground term rewriting systems -- Lower bounds on the complexity of 1-time only branching programs (Preliminary version) -- On coordinated rewriting -- Elements of a general theory of combinatorial structures -- A language theoretic approach to serialization problem in concurrent systems -- Logic programming and substitutions -- A lower bound on the oscilation complexity of context-free languages -- Depth efficient transformations of arithmetic into boolean circuits -- Free cost measures of trees -- Discrete extremal problems on covering -- Parallel algorithms for connected components in a graph -- Statistical testing of finite sequences based on algorithmic complexity -- Lower bounds for boolean formulae of depth 3 and the topology of the n-Cube (Preliminary version) -- Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete -- Linear comparison complexity of the n-cube membership problem -- String grammars with disconnecting -- Array processing machines -- A fast heuristic for covering polygons by rectangles -- ? ??????? ? ???????????? ?????? ????????? ?????? -- Products of group languages -- The complexity of embedding graphs into binary trees -- On some topological properties of logicprograms -- Recent results on continuous ordered algebras -- Are lower bounds on the complexity lower bounds for universal circuits? -- Probabilistic algorithms in group theory -- Recent results on codes -- A multiparameter analysis of the boundedness problem for vector addition systems -- About two-way transducers -- Parallel time O(log N) recognition of unambiguous CFLs -- On colour critical graphs -- Generalized thue-morse sequences -- Tree-partite graphs and the complexity of algorithms -- A quadratic regularity test for non-deleting macro s grammars -- Continuous abstract data types: Basic machinery and results -- On the length of single dynamic tests for monotone boolean functions -- Enumerative combinatorics and algebraic languages -- On several kinds of space-bounded on-line multicounter automata -- Iterated linear control and iterated one-turn pushdowns -- On the boolean closure of NP -- The critical complexity of all (monotone) boolean functions and monotone graph properties -- Degeneration of Shimura surfaces and a problem in coding theory -- Quantifiers in combinatory PDL: Completeness, definability, incompleteness -- Partial ordering derivations for CCS -- Intersecting two polyhedra one of which is convex. | |
| 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 Complexité de calcul (informatique) | ||
| 650 | |a Informatique |x Mathématiques | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Budach, Lothar, |d 1935- |4 pbd | |
| 776 | 0 | |0 02753068X |t Fundamentals of computation theory |o FCT '85, Cottbus, GDR, September 9-13, 1985 |f edited by Lothar Budach |d 1985 |c Berlin |n Springer-Verlag |p 1 vol. (XII-542 p.) |s Lecture notes in computer science |z 3-540-15689-5 | |
| 776 | 0 | |t Fundamentals of Computation Theory |b Texte imprimé |z 9783662179901 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0028784 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-VRGTHVN5-M |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747920699 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0028784 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75093316X |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0028784 |z Accès INSA CVL | |
| 997 | |0 944323 |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/ | ||