Finite automata theory, studied in the previous chapter, can be viewed as a theory that investigates problem oriented computations. Generally speaking, problem oriented computations solve certain problems about data. Computer programmers as well as users deal with problem oriented computations daily. A programmer, given a computer program and an input, runs the program on the input, and the program gives an output upon termination thus solving a certain problem about the input. Therefore, for these programs, nontermination is considered to be a failure.
KeywordsOrder Logic Finite Index Finite Automaton Successor Function Transition Table
Unable to display preview. Download preview PDF.