which, again, we can solve using a Cauchy integral and (31). The problem of finding K± is more delicate. At first sight, we could take the logarithm of (33), giving logK+− logK− = logG. This looks similar to (31), but it usually happens that logG(t) is not continuous for all t ∈ C , which means that we cannot use (30). However, this difficulty can be overcome. The problem of finding K± such tha...

We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of infix-free languages and also a proper subfamily of comma-free languages. Based on these observations, we design a polynomial-time algorithm that determines overlapfreeness of a regular language. We consider two case...

We present an algorithm to compute an approximate overlap of two convex polytopes P1 and P2 in R3 under rigid motion. Given any ε ∈ (0, 1/2], our algorithm runs in O(ε−3n log3.5 n) time with probability 1− n−O(1) and returns a (1− ε)-approximate maximum overlap, provided that the maximum overlap is at least λ ·max{|P1|, |P2|} for some given constant λ ∈ (0, 1]. 1998 ACM Subject Classification F...