某些无限正则语言族的非终结复杂性
Nonterminal complexity of some families of infinite regular languages
摘要：
上下文无关语言的非终结符复杂度是指在其生成文法中非终结符的最小可能数量。非终结符复杂度计算问题在一般情况下是不可解的，但它可以在不同的正则语言族中计算。本文研究了几类无限正则语言的非终结复杂性。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
