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.
Bassino, F., Giambruno, L., Nicaud, C. (2010). Complexity of operations on cofinite languages. In Lecture Notes in Computer Science (pp.222-233) [10.1007/978-3-642-12200-2_21].
Complexity of operations on cofinite languages
GIAMBRUNO, Laura;
2010-01-01
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
