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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.