An NP-hardness Result on the Monoid Frobenius Problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The following problem is NP-hard: given a regular expression $E$, decide if $E^*$ is not co-finite.
2 pages, working paper; an error in Problem 5 is corrected

Keywords

Discrete Mathematics, Computational Complexity, F.2.2; G.2.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/163751

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0805.4049
 http://arxiv.org/abs/0805.4049

Collections

arXiv