arXiv subjects
Publications and source records attributed to Dmitry Golubenko.
Nonterminal complexity of a context-free language is the smallest possible number of nonterminals in its generating grammar. While in general case nonterminal complexity computation problem is unsolvable, it can be computed for different families of regular languages. In this paper we study nonterminal complexity of some families of infinite regular languages.
Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger representation theorem. We present the proof which doesn't use any formal language theory tool at all except the representation theorem, just some linear algebra.
Determinantal processes on half-integer line can be studied using vertex algebras. They were used by Okounkov, where Schur processes were introduced and proved to be determinantal. We want to extend this vertex algebra approach. First, we establish the connection between the so-called z-measures and Virasoro operators. In fact, we prove that z-measures can be established by Virasoro algrebra action on Young diagrams space. Second, we introduce Virasoro measures and prove their determinancy.