Abstract
The concept of rough set theory was introduced in Formal Languages and Automata theory to find Rough Automata, Rough Languages and Rough Grammar. Rough Automata theory can be recognized as an efficient mathematical model in Machine learning and Data mining. In this research article, the rough sets notion is introduced in two dimensional automata theory. Rough set idea is incorporated in Two Dimensional Four Way Finite State Automata and Two Dimensional Online Tesselation Automata to give Two Dimensional Four Way Rough Finite state Automata and Two Dimensional Rough Online Tesselation Automata respectively. The Rough transition map extension of Two Dimensional Rough Online Tesselation Automata is done. The characterizations of Two Dimensional Rough Online Tesselation Automata are studied. Closure properties of Rough Languages recognized by Two Dimensional Rough Online Tesselation Automata under Boolean operations are obtained. Finally the relationship between Two Dimensional Four Way Rough Finite state Automata and Two Dimensional Rough Online Tesselation Automata is established.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
