On Coverings of Rough Transformation Semigroups

Products of rough finite state machines

“…The concept of coverings of finite state machines has been introduced and studied in [7]. We close this subsection by recalling the concept of covering of rough finite state machines, recently introduced in [25]. Definition 2.13 Let M1 = (Q1, R1, X1, δ1) and M2 = (Q2, R2, X2, δ2) be rough finite state machines.…”

“…Following the advent of rough set theory, Basu [3] recently introduced the concept of a rough finite state (semi)automaton, by allowing a state, when given an input, to 'transition' to a rough set of the state set (rather than a subset or a fuzzy set) in a certain way and extended the idea further by designing a recognizer that accepts imprecise statements (cf., [3], for more details). Inspired from the work of Basu, Tiwari and Sharan [25] introduced the concepts of rough transformation semigroup associated with a rough finite state machine and coverings of rough finite state machines. Recently, Tiwari, Srivastava and Sharan [26] introduced and studied the algebraic concepts such as separatedness, connectedness and retrievability of such machines.…”