A language L over an alphabet Î£ is suffix-convex if, for any words x, y, z âˆˆ Î£âˆ—, whenever z and xyz are in L, then so is yz. Suffixconvex languages include three special cases: left-ideal,â€¦ (More)

A language L over an alphabet Î£ is prefix-convex if, for any words x, y, z âˆˆ Î£ * , whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, andâ€¦ (More)

We derive an explicit piecewise-polynomial closed form for the probability density function of the distance traveled by a uniform random walk in an odd-dimensional space, based on recent work ofâ€¦ (More)

We study the state complexity of binary operations on regular languages over different alphabets. It is known that if Lâ€²m and Ln are languages of state complexities m and n, respectively, andâ€¦ (More)

A language L is suffix-convex if for any words u, v,w, whenever w and uvw are in L, vw is in L as well. Suffix-convex languages include left ideals, suffix-closed languages, and suffix-freeâ€¦ (More)