RatnaPavani

1. NFA vs DFA The theory of computation is a branch of computer science that deals with how problems are solved using algorithms. It has three branches, namely; the computational complexity theory, the computability theory, and the automaton theory. The automaton or automata theory is the study of abstract mathematical machines or systems that can be used to solve computational problems. An automaton is made up of states and transitions, and as it sees a symbol or letter of input, it makes a transition to another state taking the current state and symbol as input. The automaton or automata theory has several classes that include the Deterministic Finite Automata (DFA) and the Nondeterministic Finite Automata (NFA). These two classes are transition functions of automata or automaton. In transition, DFA cannot use n empty string, and it can be understood as one machine. If the string ends at a state that is not an acceptable state, DFA will reject it. A DFA ma

Searching Techniques Every AI program has to do the process of searching for the solution steps are not explicit in nature.   This searching is needed for solution steps are not known before hand and have to be found out.   Basically to do a search process the following steps are needed. 1. The initial state description of the problem. 2. A set of legal operators that changes the state. 3. The final or goal state.           The searching process in AI can be broadly classified into two major parts. 1. Brute force searching techniques (Or) Uninformed searching techniques. 2. Heuristic searching techniques (Or) Informed searching techniques. Brute force searching techniques:            In which, there is no preference is given to the order of successor node generation and selection. The path selected is blindly or mechanically followed. No information is used to determine the preference of one child over another. These are commonly used search procedures, w