arXiv Open Access 2021

Nonterminal complexity of some families of infinite regular languages

Dmitry Golubenko

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.FL

Penulis (1)

Dmitry Golubenko

Format Sitasi

APA MLA BibTeX

Golubenko, D. (2021). Nonterminal complexity of some families of infinite regular languages. https://arxiv.org/abs/2103.11174

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2021
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓