Characteristic of languages, representable in columns with noted tops (Q2901749)

A theorem similar to the one of Myhill-Nerode is proved for languages representable by graphs with marked vertices. Two ways to prove the theorem are presented. It is shown that to any language generated by the graph with marked vertices there corresponds a unique isomorphism of columns with the minimum number of vertices and a unique system of left-linear equations of minimum order from which an initial regular expression which describes this language can be obtained.