Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Theoretical Aspects of Computing

ICTAC 2005: Theoretical Aspects of Computing – ICTAC 2005 pp 96–109Cite as

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3722))

Abstract

A string x is an outfix of a string y if there is a string w such that x 1 wx 2=y, where x = x 1 x 2 and a set X of strings is outfix-free if no string in X is an outfix of any other string in X. We examine the outfix-free regular languages. Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines the outfix-freeness of regular languages. We consider two cases: A language is given as a set of strings and a language is given by an acyclic deterministic finite-state automaton. Furthermore, we investigate the prime outfix-free decomposition of outfix-free regular languages and design a linear-time prime outfix-free decomposition algorithm for outfix-free regular languages. We demonstrate the uniqueness of prime outfix-free decomposition.

The authors were supported under the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6197/01E.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Béal, M.-P., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundamenta Informaticae 56(1-2), 121–135 (2003)

    MATH  MathSciNet  Google Scholar 

  2. Clarke, C.L.A., Cormack, G.V.: On the use of regular expressions for searching text. ACM Transactions on Programming Languages and Systems 19(3), 413–426 (1997)

    Article  Google Scholar 

  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)

    MATH  Google Scholar 

  4. Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Information Processing Letters 67(3), 111–117 (1998)

    Article  MathSciNet  Google Scholar 

  5. Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. International Journal of Foundations of Computer Science 14, 1019–1032 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Giammarresi, D., Montalbano, R.: Deterministic generalized automata. Theoretical Computer Science 215, 191–208 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Han, Y.-S., Trippen, G., Wood, D.: Simple-regular expressions and languages. In: Proceedings of DCFS 2005, pp. 146–157 (2005)

    Google Scholar 

  8. Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. To appear in International Journal of Foundations of Computer Science (2005)

    Google Scholar 

  9. Han, Y.-S., Wang, Y., Wood, D.: Prefix-free regular-expression matching. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 298–309. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. International Journal of Foundations of Computer Science 16(3), 499–510 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ito, M., Jürgensen, H., Shyr, H.-J., Thierrin, G.: N-prefix-suffix languages. International Journal of Computer Mathematics 30, 37–56 (1989)

    Article  MATH  Google Scholar 

  12. Ito, M., Jürgensen, H., Shyr, H.-J., Thierrin, G.: Outfix and infix codes and related classes of languages. Journal of Computer and System Sciences 43, 484–508 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  13. Jürgensen, H.: Infix codes. In: Proceedings of Hungarian Computer Science Conference, pp. 25–29 (1984)

    Google Scholar 

  14. Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar. Handbook of Formal Languages, vol. 1, pp. 511–607. Springer, Heidelberg (1997)

    Google Scholar 

  15. Long, D.Y., Ma, J., Zhou, D.: Structure of 3-infix-outfix maximal codes. Theoretical Computer Science 188(1-2), 231–240 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  16. Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages. Technical Report 222, TUCS (1998)

    Google Scholar 

  17. Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica 15(3), 339–351 (2002)

    MATH  MathSciNet  Google Scholar 

  18. Shyr, H.-J.: Lecture Notes: Free Monoids and Languages. Hon Min Book Company, Taichung (1991)

    Google Scholar 

  19. Wood, D.: Data structures, algorithms, and performance. Addison-Wesley Longman Publishing Co., Inc., Boston (1993)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Hong Kong University of Science and Technology,  

    Yo-Sub Han & Derick Wood

Authors
  1. Yo-Sub Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Derick Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Technology, Vietnam National University, Hanoi, Vietnam

    Dang Van Hung

  2. Institute of Computer Science, LMU Munich, Munich, Germany

    Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, YS., Wood, D. (2005). Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. In: Van Hung, D., Wirsing, M. (eds) Theoretical Aspects of Computing – ICTAC 2005. ICTAC 2005. Lecture Notes in Computer Science, vol 3722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560647_6

Download citation

  • DOI: https://doi.org/10.1007/11560647_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29107-7

  • Online ISBN: 978-3-540-32072-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation