Formal languages ana grammars, wmcn generate tnem, cannot be successfully applied to model a real language, as they do not include the incorrectness and ambiguity of natural languages. Imprecision of real language can be incorporated in the formal language theory with the help of rough sets. Accordingly a precise language set is replaced by a pair of sets, which act as the two boundaries between which the actual set lies. In this paper we define a rough grammar and a rough language based on the concept of rough set A necessary and sufficient condition for the rough language to be a rough set is obtained. It is found that there may be 16 different classes of rough languages. A hierarchy among the different classes of languages is established.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.