Automata Languages And Programming 13th International Colloquium Rennes France July 15 19 1986 Proceedings LNCS 226(1st Edition)
Authors:
Laurent Kott
In Stock
Shipment time
Expected shipping within 2 DaysPopular items with books
Total Price:
$0
Solution Manual Includes
Price:
$9.99
Book details
ISBN: 3540167617, 978-3540167617
Book publisher: Springer
Book Summary: Characterizations of PUNC and precomputation.- Comparison of algorithms controlling concurrent access to a 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 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 of real 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.
Customers also bought these books
Mathematical Mythology The Experience Of Mathematical Functional Modeling Of Mythological Information - 1st Edition
Ramil Aliyev
ISBN: 6202063076, 978-6202063074
$0 $59.00Frequently Bought Together
Solid Liquid Separation Equipment Selection And Process Design Equipment Selection And Process Design - 1st Edition
Steve Tarleton
ISBN: 1856174212,0080467172
$0 $325.00
Fortschritte Der Chemie Organischer Naturstoffe / Progress In The Chemistry Of Organic Natural Products - 1st Edition
J C Braekman
ISBN: 3709172357, 978-3709172353
$0 $109.99
Statistics For Business & Economics - 13th Edition
David R. Anderson
ISBN: 1305585313, 978-1305585317
$0 $11.01
Selling Today Partnering to Create Value - 14th edition
Gerald L. Manning
ISBN: 9789353060428, 9780134478364 , 978-0134477404
$0 $49.95
Principles And Practice Of Constraint Programming 25th International Conference CP 2019 Stamford CT USA September 30 October 4 2019 Proceedings LNCS 11802 - 1st Edition
Thomas Schiex
ISBN: 3030300471, 978-3030300470
$0 $47.62
Programming How Does A Computer Think Skillonauts - 1st Edition
Mrs Kasia Palys-Kawalec
ISBN: 8396645795, 978-8396645791
$0 $8.70Top Reviews for Books
