User:Sandy sandeep sharma/sandbox

finite automata accepted/rejected finite string of symbols and only produces a unique computation, (or run),of the automaton for each input string. A finite automata can be represented by 5 tuple.