Automata theory is study of mathematical properties of abstract computing machine. One of the applications of finite automata is lexical analysis. Researchers proposed rough finite state automata or fuzzy automata as recognizer that accepts imprecise languages. It defines formal languages and decides if any string belongs to the language or not. We have proposed rough fuzzy (final) automata model in this article. This model recognizes rough fuzzy (final) languages. It is suitable as a lexical analyzer when the decision values are fuzzy or can be converted to fuzzy.
Skip Nav Destination
Research Article| January 10 2019
Rough fuzzy (final) automata
AIP Conf. Proc. 2061, 020019 (2019)
Alka Tripathi, Kanchan Tyagi; Rough fuzzy (final) automata. AIP Conf. Proc. 10 January 2019; 2061 (1): 020019. https://doi.org/10.1063/1.5086641
Download citation file: