State complexity of prefix-free regular languages

8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006 - Proceedings

Volumn , Issue , 2006, Pages 165-176

  Han, Yo Sub ^a   Salomaa, Kai ^b   Wood, Derick ^c  

^a Korea Institute of Science and Technology   (South Korea)

^b QUEEN S UNIVERSITY   (Canada)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DISPERSION COMPENSATION;

BASIC OPERATION; FINAL STATE; FINITE-STATE AUTOMATA; KLEENE STAR; NUMBER OF STATE; STATE COMPLEXITY; TARGET STATE; UNION OPERATIONS;

CONTEXT FREE LANGUAGES;

EID: 67649996002     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. C. Câmpeanu, K. Culik II, K. Salomaa, and S. Yu. State complexity of basic operations on finite languages. In Proceedings of WIA'99, 60-70. Springer-Verlag, 2001. Lecture Notes in Computer Science 2214.
2. C. Câmpeanu, K. Salomaa, and S. Yu. Tight lower bound for the state complexity of shuffle of regular languages. Journal of Automata, Languages and Combinatorics, 7(3):303-310, 2002.
3. M. Domaratzki. State complexity of proportional removals. Journal of Automata, Languages and Combinatorics, 7(4):455-468, 2002.
4. D. Giammarresi and R. Montalbano. Deterministic generalized automata. Theoretical Computer Science, 215:191-208, 1999.
5. Y.-S. Han, Y. Wang, and D. Wood. Prefix-free regular-expression matching. In Proceedings of CPM'05, 298-309. Springer-Verlag, 2005. Lecture Notes in Computer Science 3537.
6. Y.-S. Han and D. Wood. The generalization of generalized automata: Expression automata. International Journal of Foundations of Computer Science, 16(3):499- 510, 2005.
7. Y.-S. Han and D. Wood. Outfix-free regular languages and prime outfix-free decomposition. In Proceedings of ICTAC'05, 96-109. Springer-Verlag, 2005. Lecture Notes in Computer Science 3722.
8. M. Holzer and M. Kutrib. Nondeterministic descriptional complexity of regular languages. International Journal of Foundations of Computer Science, 14(6):1087-1102, 2003.
9. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 2 edition, 1979.
10. M. Ito, H. Jürgensen, H.-J. Shyr, and G. Thierrin. N-prefix-suffix languages. International Journal of Computer Mathematics, 30:37-56, 1989.
11. M. Ito, H. Jürgensen, H.-J. Shyr, and G. Thierrin. Outfix and infix codes and related classes of languages. Journal of Computer and System Sciences, 43:484-508, 1991.
12. H. Jürgensen and S. Konstantinidis. Codes. In G. Rozenberg and A. Salomaa, editors, Word, Language, Grammar, volume 1 of Handbook of Formal Languages, 511-607. Springer-Verlag, 1997.
13. G. Pighizzini and J. Shallit. Unary language operations, state complexity and jacobsthal's function. International Journal of Foundations of Computer Science, 13(1):145-159, 2002.
14. A. Salomaa, D. Wood, and S. Yu. On the state complexity of reversals of regular languages. Theoretical Computer Science, 320(2-3):315-329, 2004.
15. D. Wood. Theory of Computation. John Wiley & Sons, Inc., New York, NY, 1987.
16. S. Yu, Q. Zhuang, and K. Salomaa. The state complexities of some basic operations on regular languages. Theoretical Computer Science, 125(2):315-328, 1994.