Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages

Brzozowski, JA; Sinnamon, C

Brzozowski, JA (reprint author), Univ Waterloo, David R Cheriton Sch Comp Sci, Waterloo, ON N2L 3G1, Canada.

ACTA CYBERNETICA, 2017; 23 (1): 9

Abstract

A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix......

Full Text Link