ACCEPTABLE STRINGS IN AN AUTOMATON
By
Mridul Dutta1 and Padma Bhushan Borah2
1Department of Mathematics, Dudhnoi College, Goalpara, Assam, India-783124
2Department of Mathematics, Cotton University, Assam, India-781001
Email: mridulduttamc@gmail.com, padmabhushanborah@gmail.com
(Received: September 30, 2022; In format: October 08, 2022; Revised: August 15, 2023; Accepted: November 26, 2023)
DOI: https://doi.org/10.58250/jnanabha.2023.53228
Abstract
This paper is a presentation and discussion of two proofs of a theorem. The theorem is a statement about a specific type of sequence of inputs where all multiples of fixed denominations are accepted as inputs of an automaton. The theorem has interesting implications for accepted strings in a nite automaton in general setting. Here, we have examined different methods for proving the theorem. We present one analytic proof by using automata theory with graph theoretic concepts and another proof by utilizing the ordered partition of number theory. We also illustrate the results with the help of examples.
2020 Mathematical Sciences Classification: 03D05, 11B85, 68R15.
Keywords and Phrases: Finite Automata, Acceptable Strings, Ordered Partition.