Complexity of operations on cofinite languages

Frédérique Bassino (1) , Laura Giambruno (2) , Cyril Nicaud (3)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 Dipartimento di Matematica e Applicazioni [Palermo]
3 LIGM - Laboratoire d'Informatique Gaspard-Monge

We study the worst case complexity of regular operation on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the resulting minimal automata.

Mots clés: automata; state complexity

Domaines: Algorithme et structure de données [cs.DS]

Frédérique Bassino, Laura Giambruno, Cyril Nicaud. Complexity of operations on cofinite languages. 9th Latin American Theoretical INformatics Symposium (LATIN 2010), Apr 2010, Oaxaca, Mexico. pp.222-233. ⟨hal-00459651⟩