3 papers
cs.FL2021
Nonterminal complexity of some families of infinite regular languages
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 computatio…
cs.FL2017
Proving Parikh's theorem using Chomsky-Schutzenberger theorem
Dmitry Golubenko
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…
math.RT2017
Probabilistic aspects of the theory of vertex algebras
Dmitry Golubenko
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.…