4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.FL2010
Transition Complexity of Incomplete DFAs
Yuan Gao, Kai Salomaa, Sheng Yu
In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been…
cs.FL2010★ 4 cited
State complexity of union and intersection combined with star and reversal
Yuan Gao, Sheng Yu
In this paper, we study the state complexities of union and intersection combined with star and reversal, respectively. We obtain the state complexities of these combined operation…