Titlebook: Automata, Languages and Programming; 15th International C Timo Lepist?,Arto Salomaa Conference proceedings 1988 Springer-Verlag Berlin Heid

詩集

padding

箴言

Dynamic programming on graphs with bounded treewidth,partial .-trees), for fixed .. We introduce two classes of graph decision problems, LCC and ECC, and subclasses .-LCC, and .-ECC. We show that each problem in LCC (or .-LCC) is solvable in polynomial (.(..)) time, when restricted to graphs with fixed upper bounds on the treewidth and degree; and tha

憤憤不平

Neonatal

Venules

Ointment

胰島素

,Transitive orientations, m?bius functions, and complete semi-thue systems for free partially commut of . is a polynomial in the ring of formal power series . 《.》. Taking representatives we may view it as a polynomial in .《.*》. We call it unambiguous if its formal inverse in .《.*》 is the characteristic series over a set of representatives of .. The main result states that there is an unambiguous M

Commemorate

The complexity of matrix transposition on one-tape off-line turing machines with output tape, one-tape off-line TM‘s with a write-only output tape. (“Off-line” means: having a two-way input tape.) The following optimal lower bound is shown: Computing the transpose of Boolean ?×?-matrices takes Ω(?.)=Ω(n.) steps on such TM‘s. (n=?. is the length of the input.)

舊石器

,Arrangements of curves in the plane — topology, combinatorics, and algorithms,, algebraic cell decomposition, etc.). In this paper we study various topological and combinatorial properties of such arrangements under some mild assumptions on the shape of the curves, and develop basic tools for the construction, manipulation, and analysis of these arrangements. Our main results