Analysis of deterministic finite automaton in computability logic
Xiaohong Chen · Journal of Chongqing University of Posts and Telecommunications · 2011
For the identification process of character string in DFA(deterministic finite automaton),using computability logic theory to analyze the form of state function and the faction of DFA is put forward in this paper.According to the computability logic theory,computability question is a game between the machine and environment.Likewise the identification process of character string in DFA is regarded as a game between machine and user.