We compare the nondeterministic state complexity of unary regular languages and that of their complements: if a unary language L has a succinct nondeterministic finite automaton, then nondeterminism is useless in order to recognize its complement, namely, the smallest nondeterministic automaton accepting the complement of L has as many states as the minimum deterministic automaton accepting it. The same property does not hold in the case of automata and languages defined over larger alphabets. We also show the existence of infinitely many unary regular languages for which nondeterminism is useless in their recognition and in the recognition of their complements.
Complementing unary nondeterministic automata / F. Mera, G. Pighizzini. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 330:2(2005), pp. 349-360.
Complementing unary nondeterministic automata
F. MeraPrimo
;G. PighizziniUltimo
2005
Abstract
We compare the nondeterministic state complexity of unary regular languages and that of their complements: if a unary language L has a succinct nondeterministic finite automaton, then nondeterminism is useless in order to recognize its complement, namely, the smallest nondeterministic automaton accepting the complement of L has as many states as the minimum deterministic automaton accepting it. The same property does not hold in the case of automata and languages defined over larger alphabets. We also show the existence of infinitely many unary regular languages for which nondeterminism is useless in their recognition and in the recognition of their complements.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.