arXiv Open Access 2012

The state complexity of star-complement-star

Galina Jiraskova Jeffrey Shallit

Lihat Sumber

Abstrak

We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (c(L*))*, where c() denotes complement.

Topik & Kata Kunci

cs.FL

Penulis (2)

Galina Jiraskova

Jeffrey Shallit

Format Sitasi

APA MLA BibTeX

Jiraskova, G., Shallit, J. (2012). The state complexity of star-complement-star. https://arxiv.org/abs/1203.5353

Akses Cepat

Lihat di Sumber

Informasi Jurnal

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