Abstract: Associative Finite Binary Automaton, Commutative Finite Binary Automaton, AC Finite Binary Automaton have been introduced. Cross Product of Finite Binary Automatons has been defined. If B1 = (Q1, Δ1, Ʃ1, δ1, p0, F1) and B2 = (Q2, Δ2, Ʃ2, δ2, q0, F2) are any two Finite Binary Automatons, then B1×B2 is also a finite binary automaton. If B1 = (Q1, Δ1, Ʃ1, δ1, p0, F1) and B2 = (Q2, Δ2, Ʃ2, δ2, q0, F2) are any two Associative Finite Binary Automatons, then B1×B2 is also an associative finite binary automaton. If B1 = (Q1, Δ1, Ʃ1, δ1, p0, F1) and B2 = (Q2, Δ2, Ʃ2, δ2, q0, F2) are any two commutative Finite Binary Automatons, then B1×B2 is also a commutative finite binary automaton. If B1 = (Q1, Δ1, Ʃ1, δ1, p0, F1) and B2 = (Q2, Δ2, Ʃ2, δ2, q0, F2) are any two AC Finite Binary Automatons, then B1×B2 is also an AC commutative finite binary automaton...
Keywords: Finite Binary Automaton, Associative Finite Binary Automaton, Commutative Finite Binary Automaton, AC Finite Binary Automaton
[1]. S.Shanmugavadivoo And Dr. M.Kamaraj, "Finite Binary Automata" "International Journal Of Mathematical Archive", 7(4),2016, Pages 217-223.
[2]. John E. Hopcroft , Jeffery D.Ullman, Introduction To Automata Theory, Languages, And Computation, Narosa Publising House,.
[3]. Zvi Kohavi, Switching And Finite Automata Theory, Tata Mcgraw-Hill Publising Co. Lid.
[4]. John T.Moore, The University Of Florida /The University Of Western Ontario, Elements Of Abstract Algebra, Second Edition, The Macmillan Company, Collier-Macmillan Limited, London,1967.
[5]. J.P.Tremblay And R.Manohar, Discrete Mathematical Structures With Applications To Computer Science, Tata Mcgraw-Hill Publishing Company Limited, New Delhi, 1997.