Outfix-free regular languages and prime outfix-free decomposition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3722 LNCS, Issue , 2005, Pages 96-109

  Han, Yo Sub ^a   Wood, Derick ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-STATE AUTOMATON; OUTFIX-FREE DECOMPOSITION; OUTFIX-FREE REGULAR LANGUAGES;

ALGORITHMS; AUTOMATION; DECOMPOSITION; LOGIC DESIGN; POLYNOMIALS;

FORMAL LANGUAGES;

EID: 33646389805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560647_6     Document Type: Conference Paper

References (19)

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. D. Giammarresi and R. Montalbano. Deterministic generalized automata. Theoretical Computer Science, 215:191-208, 1999.
7. Y.-S. Han, G. Trippen, and D. Wood. Simple-regular expressions and languages. In Proceedings of DCFS'05, 146-157, 2005.
8. Y.-S. Han, Y. Wang, and D. Wood. Infix-free regular expressions and languages. To appear in International Journal of Foundations of Computer Science, 2005.
9. 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.
10. 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.
11. M. Ito, H. Jürgensen, H.-J. Shyr, and G. Thierrin. N-prefix-suffix languages. International Journal of Computer Mathematics, 30:37-56, 1989.
12. 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.
13. H. Jürgensen. Infix codes. In Proceedings of Hungarian Computer Science Conference, 25-29, 1984.
14. 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.
15. D. Y. Long, J. Ma, and D. Zhou. Structure of 3-infix-outfix maximal codes. Theoretical Computer Science, 188(1-2):231-240, 1997.
16. A. Mateescu, A. Salomaa, and S. Yu. On the decomposition of finite languages. Technical Report 222, TUCS, 1998.
17. A. Mateescu, A. Salomaa, and S. Yu. Factorizations of languages and commutativity conditions. Acta Cybernetica, 15(3):339-351, 2002.
18. H.-J. Shyr. Lecture Notes: Free Monoids and Languages. Hon Min Book Company, Taichung, Taiwan R.O.C, 1991.
19. D.Wood. Data structures, algorithms, and performance. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1993.