A Mathematical Approach to the Theory of Finite Automata
Chac Kwan · Preprints.org · 2025
There is a lack of rigorous mathematical treatment in the theory of finite automata. This paper provides a rigorous mathematical approach to automata theory which doesn’t currently exist in the literature of theoretical computer science. Basic definitions are developed in mathematical terms and used as the foundation for constructing mathematical proofs for theorems. It provides a model for instructors to write better lecture notes and authors to write better textbooks for educational purpose. It also corrects some critical errors and erroneous arguments that can be found in many textbooks which are widely used in the education of theoretical computer science.