Automata, Languages and Programming: 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings (Lecture Notes in Computer Science (226), Band 226)Taschenbuch
Characterizations of P U N C 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 R A Ms 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 U P. - 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 N P-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. . .
|
Bücher
hier kostenlos
