23 citations · 51 across the 17 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.FL2013★ 2 cited
Symmetric Groups and Quotient Complexity of Boolean Operations
Jason Bell, Janusz Brzozowski, Nelma Moreira +1
The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular langu…
cs.FL2013
Incomplete Transition Complexity of Basic Operations on Finite Languages
Eva Maia, Nelma Moreira, Rogério Reis
The state complexity of basic operations on finite languages (considering complete DFAs) has been in studied the literature. In this paper we study the incomplete (deterministic) s…