ROUGH FINITE-STATE AUTOMATA
Author:
- 18 January 2005
- journal article
- research article
- Published by Taylor & Francis in Cybernetics and Systems
- Vol. 36 (2) , 107-124
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Rough Sets in Knowledge Discovery 21998
- Rough Sets Through Algebraic LogicFundamenta Informaticae, 1996
- Rough Sets1991
- Rough setsInternational Journal of Parallel Programming, 1982