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

Theoretical Computer Science

Volumn 410, Issue 47-49, 2009, Pages 5010-5021

  Kao, Jui Yi ^a,b   Rampersad, Narad ^a,c   Shallit, Jeffrey ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Stanford University   (United States)

^c UNIVERSITY OF WINNIPEG   (Canada)

Author keywords

Nondeterministic finite automata; PSPACE complete problem; State complexity

Indexed keywords

FINITE AUTOMATA; PIPELINE PROCESSING SYSTEMS;

HARDNESS RESULT; NONDETERMINISTIC FINITE AUTOMATON; NONUNIVERSALITY; PSPACE-COMPLETE PROBLEMS; STATE COMPLEXITY;

NANOSTRUCTURED MATERIALS;

EID: 77953746105     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.07.049     Document Type: Article

References (16)

1. Aho A, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. J.-C. Birget, Partial orders on words, minimal elements of regular languages, and state complexity, Theoret. Comput. Sci. 119 (1993) 267-291. Erratum available at: http://clam.rutgers.edu/~birget/papers.html.
3. J.A. Brzozowski, J. Shallit, Z. Xu, Decision problems for convex languages, in: Volker Diekert, Dirk Nowotka (Eds.), Developments in Language Theory (13th International Conference, DLT 2009, Stuttgart, Germany, June 30-July 3, 2009. Proceedings), in: Lecture Notes in Computer Science, vol. 5583, Springer, 2009, pp. 247-258. Preprint, 2008, Available at: http://arxiv.org/ abs/0808.1928.
4. K. Ellul, B. Krawetz, J. Shallit, M.-w. Wang, Regular expressions: New results and open problems, J. Automata, Languages, and Combinatorics 10 (2005) 407-437.
5. Yu.L. Ershov, On a conjecture of V. A. Uspenskii, Algebra i Logika 1 (4) (1962) 45-48 (in Russian).
6. M.R. Garey, D.S.Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
7. A. Gill, L. Kou, Multiple-entry finite automata, J. Comput. System Sci. 9 (1974) 1-19.
8. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
9. G.Jirásková, State complexity of some operations on binary regular languages, Theoret. Comput. Sci. 330 (2005) 287-298. (Pubitemid 40086021)
10. A.R. Meyer, M.J. Fischer, Economy of description by automata, grammars, and formal systems, in: Conference Record 1971 Twelfth Annual Symposium on Switching and Automata Theory, IEEE Computer Society, 1971, pp. 188-191.
11. A.R. Meyer, L.J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, in: Proc. 13th Ann. IEEESymp. on Switching and Automata Theory, 1972, pp. 125-129.
12. F.R. Moore, On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata, IEEE Trans. Comput. 20(1971) 1211-1214.
13. N. Rampersad, J. Shallit, Z. Xu, The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages. Preprint, July 2009, http://arxiv.org/abs/0907.0159.
14. W. Sakoda, M. Sipser, Nondeterminism and the size of two-way finite automata, in: Proc. 10th Ann. ACM Symp. on Theory of Computing, 1978, pp. 275-286.
15. M. Sipser, Introduction to the Theory of Computation, PWS, 1996.
16. P. Veloso, A. Gill, Some remarks on multiple-entry finite automata, J. Comput. System Sci. 18 (1979) 304-306. (Pubitemid 10404467)