ISBN: 9783540398592
Computer Science; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Computation by Abstract Devices Monoid, algorithms, automata, complexity, logic Books eBook, Sp… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten Details... |
ISBN: 9783540398592
Computer Science; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Computation by Abstract Devices Monoid, algorithms, automata, complexity, logic Books eBook, Sp… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540398592
There is currently no description available Books > Computer Science eBook, Springer Shop
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540398592
There is currently no description available, Springer
Springer.com Nr. 978-3-540-39859-2. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details... |
ISBN: 9783540398592
Computer Science; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Computation by Abstract Devices Monoid, algorithms, automata, complexity, logic Books eBook, Sp… Mehr…
ISBN: 9783540398592
Computer Science; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Computation by Abstract Devices Monoid, algorithms, automata, complexity, logic Books eBook, Sp… Mehr…
ISBN: 9783540398592
There is currently no description available Books > Computer Science eBook, Springer Shop
ISBN: 9783540398592
There is currently no description available, Springer
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Automata, Languages and Programming
EAN (ISBN-13): 9783540398592
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2017-01-29T17:51:15+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-31T10:32:34+02:00 (Zurich)
ISBN/EAN: 9783540398592
ISBN - alternative Schreibweisen:
978-3-540-39859-2
Daten vom Verlag:
Autor/in: Laurent Kott
Titel: Lecture Notes in Computer Science; Automata, Languages and Programming - 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings
Verlag: Springer; Springer Berlin
476 Seiten
Erscheinungsjahr: 2005-06-30
Berlin; Heidelberg; DE
Sprache: Englisch
50,28 € (DE)
51,70 € (AT)
63,00 CHF (CH)
Available
XII, 476 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Monoid; algorithms; automata; complexity; logic; C; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Theory of Computation; Computer Science; BC
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.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387088600 Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17-21, 1978 (G. Ausiello)
< zum Archiv...