LATIN
2010
Springer
14 years 5 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...