Infix-free regular expressions and languages

International Journal of Foundations of Computer Science

Volumn 17, Issue 2, 2006, Pages 379-393

  Han, Y O Sub ^a   Wang, Yajun ^a   Wood, Derick ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746190608     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054106003887     Document Type: Article

References (18)

1. M.-P. Béal, M. Crochemore, F. Mignosi, A. Restivo, and M. Sciortino. Computing forbidden words of regular languages. Fundamenta Informaticae, 56(1-2):121-135, 2003.
2. C. L. A. Clarke and G. V. Cormack. On the use of regular expressions for searching text. ACM Transactions on Programming Languages and Systems, 19(3):413-426, 1997.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. McGraw-Hill Higher Education, 2001.
4. M. Crochemore, F. Mignosi, and A. Restivo. Automata and forbidden words. Information Processing Letters, 67(3):111-117, 1998.
5. J. Czyzowicz, W. Fraczak, A. Pelc, and W. Rytter. Linear-time prime decomposition of regular prefix codes. International Journal of Foundations of Computer Science, 14:1019-1032, 2003.
6. 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.
7. 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.
8. Y.-S. Han and D. Wood. Outfix-free regular languages and prime outfix-free decomposition. To appear in Proceedings of ICTAC'05, 2005.
9. J. Hopcroft and J. Ullman. Formal Languages and Their Relationship to Automata. Addison-Wesley, Reading, MA, 1969.
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. Infix codes. In Proceedings of Hungarian Computer Science Conference, 25-29, 1984.
13. 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.
14. D. Y. Long, J. Ma, and D. Zhou. Structure of 3-infix-outfix maximal codes. Theoretical Computer Science, 188(1-2):231-240, 1997.
15. A. Mateescu, A. Salomaa, and S. Yu. On the decomposition of finite languages. Technical Report 222, TUGS, 1998.
16. A. Mateescu, A. Salomaa, and S. Yu. Factorizations of languages and commutativity conditions. Acta Cybernetica, 15(3):339-351, 2002.
17. K. Thompson. Regular expression search algorithm. Communications of the ACM, 11:419-422, 1968.
18. D. Wood. Theory of Computation. John Wiley & Sons, Inc., New York, NY, 1987.