2021/03/20 by Dmitry Golubenko, Golubenko, Dmitry
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL
paper · pdf · doi:10.48550/arxiv.2103.11174
(to be revisited later)
arxiv created 2021/03/20 · arxiv updated 2021/03/23
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.