Automata, Languages and Programming : 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings - Livres de poche
1986, ISBN: 3540167617
[EAN: 9783540167617], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], MONOID; ALGORITHMS; COMPLEXITY; LOGIC, Druck auf Anfrage Neuware -Characterizations of PUNC and precomputation.… Plus…
ZVAB.com AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Frais d'envoiVersandkostenfrei. (EUR 0.00) Details... |
1986, ISBN: 3540167617
Broschiert 473 Seiten; Broschiert Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Inst… Plus…
Achtung-Buecher.de Versandantiquariat Petra Gros GmbH & Co. KG, 56070 Koblenz Frais d'envoiVersandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
ISBN: 9783540167617
Paperback, [PU: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG], This is a Print on Demand title. This book may have occasional imperfections such as missing or blurred pages, poor p… Plus…
BookDepository.com Frais d'envoiVersandkostenfrei. (EUR 0.00) Details... |
ISBN: 9783540167617
Automata, Languages and Programming: 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings Books > Computers > Computer Science List_Books, [PU: Springer, Berlin/H… Plus…
Indigo.ca new in stock. Frais d'envoiplus shipping costs., Livraison non-comprise Details... |
1986, ISBN: 9783540167617
13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1986
lehmanns.de Frais d'envoiVersand in 10-14 Tagen. (EUR 9.95) Details... |
Automata, Languages and Programming : 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings - Livres de poche
1986, ISBN: 3540167617
[EAN: 9783540167617], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], MONOID; ALGORITHMS; COMPLEXITY; LOGIC, Druck auf Anfrage Neuware -Characterizations of PUNC and precomputation.… Plus…
Kott, Laurent:
Automata, languages and programming; Lecture notes in computer science ; 226 - livre d'occasion1986, ISBN: 3540167617
Broschiert 473 Seiten; Broschiert Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Inst… Plus…
ISBN: 9783540167617
Paperback, [PU: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG], This is a Print on Demand title. This book may have occasional imperfections such as missing or blurred pages, poor p… Plus…
ISBN: 9783540167617
Automata, Languages and Programming: 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings Books > Computers > Computer Science List_Books, [PU: Springer, Berlin/H… Plus…
1986, ISBN: 9783540167617
13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1986
Données bibliographiques du meilleur livre correspondant
Auteur: | |
Titre: | |
ISBN: |
Informations détaillées sur le livre - Automata, Languages and Programming
EAN (ISBN-13): 9783540167617
ISBN (ISBN-10): 3540167617
Livre de poche
Date de parution: 1986
Editeur: Springer Berlin
488 Pages
Poids: 0,731 kg
Langue: eng/Englisch
Livre dans la base de données depuis 2007-11-06T00:04:44+01:00 (Paris)
Page de détail modifiée en dernier sur 2023-05-14T21:55:46+02:00 (Paris)
ISBN/EAN: 9783540167617
ISBN - Autres types d'écriture:
3-540-16761-7, 978-3-540-16761-7
Autres types d'écriture et termes associés:
Auteur du livre: laurent, kott
Titre du livre: 1986, proceedings the international colloquium language, automata languages and programming, lecture notes computer science automata
Données de l'éditeur
Auteur: Laurent Kott
Titre: Lecture Notes in Computer Science; Automata, Languages and Programming - 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings
Editeur: Springer; Springer Berlin
476 Pages
Date de parution: 1986-06-01
Berlin; Heidelberg; DE
Langue: Anglais
50,28 € (DE)
51,69 € (AT)
63,12 CHF (CH)
Available
XII, 476 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Monoid; algorithms; automata; complexity; logic; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Theory of Computation; EA
Characterizations of PUNC and precomputation.- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach.- A new duality result concerning Voronoi diagrams.- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial.- On exponential lowness.- A tradeoff between search and update time for the implicit dictionary problem.- Intersections of some families of languages.- Correspondence between ternary simulation and binary race analysis in gate networks.- Counting with rational functions.- Finite biprefix sets of paths in a Graph.- Parallel RAMs with owned global memory and deterministic context-free language recognition.- A Strong restriction of the inductive completion procedure.- On discerning words by automata.- Complexity classes without machines: On complete languages for UP.- Containment, separation, complete sets, and immunity of complexity classes.- On nontermination of Knuth-Bendix algorithm.- Tradeoffs for language recognition on parallel computing models.- Rational equivalence relations.- Some further results on digital search trees.- Knowledge, belief and time.- A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication.- Decompositions of nondeterministic reductions.- Hierarchical planarity testing algorithms.- Synthesis and equivalence of concurrent systems.- The set union problem with backtracking.- Torsion matrix semigroups and recognizable transductions.- On recognizable subsets of free partially commutative monoids.- Min Cut is NP-complete for edge weighted trees.- Alternating automata, the weak monadic theory of the tree, and its complexity.- Subpolynomial complexity classes ofreal functions and real numbers.- Etude syntaxique des parties reconnaissables de mots infinis.- Refusal testing.- A timed model for communicating sequential processes.- A uniform reduction theorem extending a result of J. Grollmann and A. Selman.- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs.- A new approach to detection of locally indicative stability.- A more efficient algorithm for lattice basis reduction.- Lower bounds by recursion theoretic arguments.- An improved algorithm for transitive closure on acyclic digraphs.- Un algorithme determinant les melanges de deux mots.- A very fast, practical algorithm for finding a negative cycle in a digraph.- A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language.- Semigroups and languages of dot-depth 2.- A parallel vertex insertion algorithm for minimum spanning trees.- More complicated questions about maxima and minima, and some closures of NP.- Lower bounds for dynamic range query problems that permit subtraction (extended abstract).- E-unification algorithms for a class of confluent term rewriting systems.- On fixed-point clones.Autres livres qui pourraient ressembler au livre recherché:
Dernier livre similaire:
9780387088600 Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17-21, 1978 (G. Ausiello)
< pour archiver...