Abstract
This paper is to study a mathematical model of computation for natural languages. Specifically, we enrich the L-fuzzy automata theory by using the concepts from L-fuzzy rough set theory so that new model, namely, L-fuzzy rough automata can handle both the concepts such as ambiguity and impreciseness arise in natural languages. Further, we study the determinization of an L-fuzzy rough automaton and introduce the concept of a factor L-fuzzy rough automaton. Also, we study some properties of L-fuzzy languages accepted by introduced concepts of L-fuzzy rough automata. Finally, we provide an application of the L-fuzzy rough automaton in a real-life problem.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
