2 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
Corwin Sinnamon
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 su…