ROUGH FINITE-STATE AUTOMATA

From MaRDI portal





The concept of rough finite-state semi-automaton (RFSSA) is formulated. Let \(Q\) be a finite set and \(Q_1,Q_2,\dots,Q_n\) be a partition on \(Q\) according to some equivalence relation \(R\), so that \(Q=Q_1 \cup Q_2 \cup \dots \cup Q_n\) and \(Q_i \cap Q_j=\emptyset\) if \(i \neq j\). The RFSSA is defined as \(A=(Q,R,X,M)\) where \(Q\), \(X\) are a set of internal states and a set of input signals, \(R\) is equivalence relation and \(M\) is a transition relation on \(Q \times X\), such that \[ \underline{M(q,\sigma)}=D_1, \overline{M(q,\sigma)}=D_2, \] where \(q \in Q\), \(\sigma \in X\) and \(D_1\), \(D_2\) are some sets, such that \(D_1 = Q_{i_1} \cup \dots \cup Q_{i_k}\), \(D_2 = Q_{j_1} \cup \dots \cup Q_{i_l}\), \(D_1 \subseteq D_2\). Some properties of RFSSA are considered. The algorithm of calculation of its connected part is given. The rough finite state automaton (RFSA) is introduced by adding initial state and a set of accepting states to RFSSA. The behaviour of RFSA is studied. It is shown that it can be used as a recognizer that accepts imprecise statements.











This page was built for publication: ROUGH FINITE-STATE AUTOMATA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4655437)