Skip to main content
Conference Proceedings

Nondeterministic state complexity of star-free languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6807 LNCS 178-189
DOI: 10.1007/978-3-642-22256-6_17
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate the nondeterministic state complexity of several operations on finite automata accepting star-free languages. It turns out that in most cases exactly the same tight bounds as for general regular languages are reached. This nicely complements the results recently obtained in [8] for the operation problem of star-free languages accepted by deterministic finite automata. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Holzer, M., Kutrib, M., & Meckel, K. (2011). Nondeterministic state complexity of star-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6807 LNCS, pp. 178–189). https://doi.org/10.1007/978-3-642-22256-6_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free