19 citations · 55 across the 13 of their papers we have counts for
1 paper · 1 filter
Galina Jirásková
We examine the complexity of basic regular operations on languages represented by Boolean and alternating finite automata. We get tight upper bounds m+n and m+n+1 for union, inters…