Minimal DFA for Symmetric Difference NFA
نویسندگان
چکیده
Recently, a characterization of the class of nondeterministic finite automata (NFAs) for which determinization results in a minimal deterministic finite automaton (DFA), was given in [2]. We present a similar result for the case of symmetric difference NFAs. Also, we show that determinization of any minimal symmetric difference NFA produces a minimal DFA.
منابع مشابه
Mergible states in large NFA
Quite often, trivial problems stated for Deterministic Finite Automata (DFA) are surprisingly difficult for the nondeterministic case (NFA). In any non-minimal DFA for a given regular language, we can find two equivalent states wich 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 pape...
متن کاملDescriptional Complexity of Determinization and Complementation for Finite Automata
In this paper we study the subset construction that transforms nondeterministic finite automata (NFA) to deterministic finite automata (DFA). It is well known that given a n-state NFA, the subset construction algorithm produces a 2-state DFA in the worst case. It has been shown that given n,m (n < m ≤ 2), there is a n-state NFA N such that the minimal DFA recognizing L(N ) has m states. However...
متن کاملConstruction of a Minimal Deterministic Finite Automaton from a Regular Expression
This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing algorithm that converts a regular expression R into a minimal deterministic finite automaton M suc...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملImplementation and analysis of NFAs with adjustable deterministic blow-up
Non-deterministic and deterministic automata both have the expressive power to recognize regular languages; thus, for any non-deterministic automaton there exists an equivalent deterministic automaton that recognizes the same regular language (and vice versa). Depending on the regular language recognized, however , the number of states in minimal NFAs and DFAs recognizing the language may diffe...
متن کامل