Inscriere cercetatori

Perioada scursă de la depunerea aplicațiilor

Proiecte de cercetare postdoctorala (PD)

Proiecte complexe de cercetare de frontiera (PCCF)

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa


Mergible states in large NFA

Domenii publicaţii > Ştiinţe informatice + Tipuri publicaţii > Articol în revistã ştiinţificã

Autori: Cezar Câmpeanu, Nicolae Sântean, and Sheng Yu

Editorial: Elsevier, Theoretical Computer Science, 330 Issue 1, p. 23-34, 2005.


Quite often, trivial problems stated for deterministic finite automata (DFA) are surprisingly difficult for the non-deterministic case (NFA). In any non-minimal DFA for a given regular language, we can find two equivalent states which can be “merged” without changing the accepted language. This is not the case for NFA, where we can have non-minimal automata with no “mergible” states. In this paper, we prove a very basic result for NFA, that for a given regular language, any NFA of size greater than a computable constant must contain mergible states. Even more, we parameterized this constant in order to guarantee groups of an arbitrary number of mergible states.

Cuvinte cheie: Nondeterministic finite automata; Mergible states; Number of states; Equivalent states