Complexity of Operations on Cofinite Languages

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 resulting minimal automata.

• Type: Conference
• Year: 2010
• Where: LATIN
• Authors: Frédérique Bassino, Laura Giambruno, Cyril Nicaud
• Keywords: Information Management, LATIN 2010, Minimal Automata, Regular Operations, Worst Case Complexity