19 citations · 121 across the 33 of their papers we have counts for
Showing 2010 · cs.FLShow all
3 papers · 2 filters
cs.FL2010★ 2 cited
Quotient Complexity of Star-Free Languages
Janusz Brzozowski, Bo Liu
The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is…
cs.FL2010
Syntactic Complexity of Ideal and Closed Languages
Janusz Brzozowski, Yuli Ye
The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is…
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…