Informal description of the sentence recognition problem

This article provides an informal definition of language and suggestions in terms of discrete mathematics and graph theory. By this definition, a set of proposals we call language is a set of rooted trees, which forms a graph. Next, we propose methods and techniques for constructing such graphs. As a result, we build a graph, called by us Tree Lang, which conditionally can be called a language.