Right-Linear Languages Generated in Systems of Knowledge Representation based on LSG

Abstract

In Tudor (Preda) (2010) a method for formal languages generation based on labeled stratified graph representations is sketched. The author proves that the considered method can generate regular languages and context-sensitive languages by considering an exemplification of the proposed method for a particular regular language and another one for a particular contextsensitive language. At the end of the study, the author highlights some open problems for future research among which we remind: (1) The study of the language families that can be generated by means of these structures; (2) The study of the infiniteness of the languages that can be represented in stratified graphs. In this paper, we extend the method presented in Tudor (Preda)(2010), by considering the stratified graph formalism in a system of knowledge representation and reasoning. More precisely, we propose a method that can be applied for generating any Right Linear Language construction. Our method is proved and exemplified in several cases.