ROUGH FINITE-STATE AUTOMATA
Sumita Basu · Cybernetics & Systems · 2005
The concept of a rough finite-state semi-automaton, in which the result of any transition is a rough set of states, is formulated and then extended to that of a rough finite-state automaton by adding the set of accepting states. The behavior of such an automaton is defined and turns out to be a rough set of input words.