Advertisement

On Language Decompositions and Primality

  • Michael Domaratzki
  • Kai Salomaa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6570)

Abstract

Concatenation of strings and languages is a fundamental operation on formal languages. Here we consider the inverse operation of language decomposition, where we want to represent a given language as a non-trivial concatenation of two languages. The associated notions of prime languages and prime decompositions have been originally introduced by Mateescu, A. Salomaa and Yu. We consider also extensions of the decomposability problem with respect to orthogonal concatenation, as well as, more general operations defined by sets of trajectories.

Keywords

Regular Language Prime Language Prime Decomposition Decomposition Problem Input Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anselmo, M., Restivo, A.: On languages factorizing the free monoid. Internat. J. Algebra and Computation 6, 413–427 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Câmpeanu, C., Salomaa, K., Vágvölgyi, S.: Shuffle decompositions of regular languages. Internat. J. Foundations of Computer Science 13, 799–816 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Choffrut, C., Karhumäki, J.: Fatou properties of rational languages. In: Martin-Vide, C., Mitrana, V. (eds.) Where Mathematics, Computer Science, Linguistics and Biology Meet, pp. 227–235 (2000)Google Scholar
  4. 4.
    Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)zbMATHGoogle Scholar
  5. 5.
    Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. Internat. J. Foundations of Computer Science 14, 1019–1031 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Daley, M., Domaratzki, M., Salomaa, K.: Orthogonal concatenation: Language equations and state complexity. J. Universal Comput. Sci. 16, 653–675 (2010)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Domaratzki, M.: Semantic shuffle on and deletion along trajectories. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 163–174. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Domaratzki, M.: Deletion along trajectories. Theoret. Comput. Sci. 320, 293–313 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Domaratzki, M.: Trajectory-Based Operations. PhD thesis, Queen’s University (2004)Google Scholar
  10. 10.
    Domaratzki, M.: More Words on Trajectories. Formal Language Theory Column, Bull. Eur. Assoc. Theor. Comp. Sci. 86, 107–145 (2005)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Domaratzki, M., Rozenberg, G., Salomaa, K.: Interpreted trajectories. Fundamenta Informaticae 73, 182–193 (2006)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Domaratzki, M., Salomaa, K.: Decidability of trajectory-based equations. Theoret. Comput. Sci. 345, 304–330 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Domaratzki, M., Salomaa, K.: Restricted sets of trajectories and decidability of shuffle decompositions. Internat. J. Foundations of Computer Science 16, 897–912 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Frid, A.: Commutation of binary factorial languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 193–204. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Han, Y.-S., Salomaa, A., Salomaa, K., Wood, D., Yu, S.: On the existence of prime decompositions. Theoret. Comput. Sci. 376, 60–69 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. Internat. J. Found. Comput. Sci. 17, 379–393 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Hinz, F., Dassow, J.: An undecidability result for regular languages and its application to regulated rewriting. Bulletin of the EATCS 38, 168–174 (1989)zbMATHGoogle Scholar
  18. 18.
    Ito, M.: Shuffle decomposition of regular languages. J. Universal Comput. Sci. 8, 257–259 (2002)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Ito, M., Kari, L., Thierrin, G.: Shuffle and scattered deletion closure of languages. Theor. Comp. Sci. 245, 115–133 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22, 1117–1141 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Karhumäki, J., Petre, I.: Two problems on commutation of languages. In: Current Trends in Theoretical Computer Science– The Challenge of the New Century, vol. 2, pp. 477–494. World Scientific, Singapore (2004)CrossRefGoogle Scholar
  22. 22.
    Kari, L.: On language equations with invertible operations. Theor. Comp. Sci. 132, 129–150 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Kari, L., Konstantinidis, S.: Language equations, maximality and error-detection. J. Comput. System Sci. 70, 157–178 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Kari, L., Sosík, P.: Aspects of shuffle and deletion on trajectories. Theoret. Comput. Sci. 332, 47–61 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Kari, L., Thierrin, G.: Maximal and minimal solutions to language equations. J. Comput. System Sci. 53, 487–496 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Kunc, M.: What do we know about language equations? In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 23–27. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  27. 27.
    Martens, W., Niewerth, M., Schwentick, T.: Schema design for XML repositories: Complexity and tractability. In: Proceedings of ACM Symposium on Principles of Database Systems, PODS 2010, June 6–11 (2010)Google Scholar
  28. 28.
    Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theoret. Comput. Sci. 197, 1–56 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica 15, 339–351 (2002)MathSciNetzbMATHGoogle Scholar
  30. 30.
    Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential time. In: Symposium on Switching and Automata Theory, SWAT 1972, pp. 125–129. IEEE Society Press, Los Alamitos (1972)Google Scholar
  31. 31.
    Okhotin, A.: Decision problems for language equations. J. Comput. System Sci. 76, 251–266 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Perrin, D.: Codes conjugués. Inform. and Control 20, 221–231 (1972)CrossRefzbMATHGoogle Scholar
  33. 33.
    Rampersad, N., Ravikumar, B., Santean, N., Shallit, J.: State complexity of unique rational operations. Theoret. Comput. Sci. 410, 2431–2441 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  34. 34.
    Rampersad, N., Shallit, J.: Private communication (2006)Google Scholar
  35. 35.
    Salomaa, A., Salomaa, K., Yu, S.: Variants of codes and indecomposable languages. Information and Computation 207, 1340–1349 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  36. 36.
    Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Proc. Developments in Language Theory, DLT 1999, pp. 22–31. World Scientific Publ. Co., Singapore (2000)Google Scholar
  37. 37.
    Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2009)zbMATHGoogle Scholar
  38. 38.
    Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer, Heidelberg (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Domaratzki
    • 1
  • Kai Salomaa
    • 2
  1. 1.Department of Computer ScienceUniversity of ManitobaWinnipegCanada
  2. 2.School of ComputingQueen’s UniversityKingstonCanada

Personalised recommendations