19 citations · 55 across the 13 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.FL2010★ 11 cited
Complexity in Prefix-Free Regular Languages
Galina Jirásková, Monika Krausová
We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over s…
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…