1 citations · 1 across the 2 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2012
The state complexity of star-complement-star
Galina Jiraskova, Jeffrey Shallit
We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (c(L*))*, where c() deno…
cs.FL2010★ 1 cited
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages
Janusz Brzozowski, Galina Jirásková, Baiyu Li +1
A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword…