2 citations · 2 across the 3 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2018
Complexity of Proper Suffix-Convex Regular Languages
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…
cs.FL2016★ 2 cited
Complexity of Prefix-Convex Regular Languages
Janusz Brzozowski, Corwin Sinnamon
A language over an alphabet is prefix-convex if, for any words , whenever and are in , then so is . Prefix-convex languages include right-idea…