On NFAs where all states are final, initial, or both

21Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we characterize the languages accepted. Finally, we discuss some state complexity problems involving such automata. © 2009 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Kao, J. Y., Rampersad, N., & Shallit, J. (2009). On NFAs where all states are final, initial, or both. Theoretical Computer Science, 410(47–49), 5010–5021. https://doi.org/10.1016/j.tcs.2009.07.049

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