Skip to main content
SpringerLink
Log in

What Do We Know About Language Equations?

  • Conference paper
Developments in Language Theory (DLT 2007)

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

Included in the following conference series:

Abstract

In the talk we give an overview of recent developments in the area of language equations, with an emphasis on methods for dealing with non-classical types of equations whose theory has not been successfully developed already in the previous decades, and on results forming the current borderline of our knowledge. This abstract is in particular meant to provide the interested listener with references to the material discussed in the talk.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aiken, A., Kozen, D., Vardi, M., Wimmers, E.: The complexity of set constraints. In: Meinke, K., Börger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol. 832, pp. 1–17. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  2. Albert, M.H., Lawrence, J.: A proof of Ehrenfeucht’s conjecture. Theoret. Comput. Sci. 41(1), 121–123 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baader, F., Küsters, R.: Unification in a description logic with transitive closure of roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 217–232. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Baader, F., Narendran, P.: Unification of concept terms in description logics. J. Symbolic Comput. 31(3), 277–305 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Baader, F., Okhotin, A.: Complexity of language equations with one-sided concatenation and all Boolean operations. In: Proc. UNIF 2006, pp. 59–73 (2006)

    Google Scholar 

  6. Bala, S.: Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms. Theory Comput. Syst. 39(1), 137–163 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cassaigne, J., Karhumäki, J., Maňuch, J.: On conjugacy of languages. Theor. Inform. Appl. 35(6), 535–550 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Charatonik, W., Podelski, A.: Co-definite set constraints. In: Nipkow, T. (ed.) Rewriting Techniques and Applications. LNCS, vol. 1379, pp. 211–225. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)

    MATH  Google Scholar 

  10. Culik II, K., Karhumäki, J.: Systems of equations over a free monoid and Ehrenfeucht’s conjecture. Discrete Math. 43(2–3), 139–153 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  11. de Luca, A., Varricchio, S.: Finiteness and Regularity in Semigroups and Formal Languages. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  12. Domaratzki, M., Salomaa, K.: Decidability of trajectory-based equations. Theoret. Comput. Sci. 345(2–3), 304–330 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoret. Comput. Sci. 27(3), 311–332 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL . J. ACM 9(3), 350–371 (1962)

    Article  MathSciNet  Google Scholar 

  15. Guba, V.S.: Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems. Mat. Zametki 40(3), 321–324 (1986)

    MATH  MathSciNet  Google Scholar 

  16. Jeandel, E., Ollinger, N.: Playing with Conway’s problem. Technical report ccsd-00013788, Laboratoire d’Informatique Fondamentale de Marseille (2005), available at http://hal.archives-ouvertes.fr/hal-00013788

  17. Jeż, A.: Conjunctive grammars can generate non-regular unary languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 23–27. Springer, Heidelberg (2007)

    Google Scholar 

  18. Karhumäki, J., Latteux, M., Petre, I.: Commutation with codes. Theoret. Comput. Sci. 340(2), 322–333 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  19. Karhumäki, J., Latteux, M., Petre, I.: Commutation with ternary sets of words. Theory Comput. Syst. 38(2), 161–169 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  20. Karhumäki, J., Lisovik, L.P.: The equivalence problem of finite substitutions on ab * c, with applications. Internat. J. Found. Comput. Sci. 14(4), 699–710 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  22. Kari, L.: On language equations with invertible operations. Theoret. Comput. Sci. 132(1–2), 129–150 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  23. Kari, L., Sosík, P.: On language equations with deletion. Bull. EATCS 83, 173–180 (2004)

    Google Scholar 

  24. Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi’s conjecture. Trans. Amer. Math. Soc. 95(2), 210–225 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  25. Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoret. Comput. Sci. 348(2–3), 277–293 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  26. Kunc, M.: Simple language equations. Bull. EATCS 85, 81–102 (2005)

    MathSciNet  Google Scholar 

  27. Kunc, M.: On language inequalities XK ⊆ LX. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 327–337. Springer, Heidelberg (2005)

    Google Scholar 

  28. Kunc, M.: Largest solutions of left-linear language inequalities. In: Proc. AFL 2005, University of Szeged, pp. 178–186 (2005), Also available at http://www.math.muni.cz/~kunc/math/left_linear.ps

  29. Kunc, M.: The power of commuting with finite sets of words. Theory Comput. Syst. 40(4), 521–551 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  30. Kunc, M.: The simplest language where equivalence of finite substitutions is undecidable. Preprint available at http://www.math.muni.cz/~kunc/math/finite_substitutions.pdf .

  31. Leiss, E.L.: Language Equations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  32. Lisovik, L.P.: The equivalence problem for finite substitutions on regular languages. Dokl. Akad. Nauk 357(3), 299–301 (1997)

    MathSciNet  Google Scholar 

  33. Ly, O.: A constructive solution of the language inequation X A ⊆ B X, Preprint available at http://www.labri.fr/perso/ly/publications/LanguageEquation.pdf .

  34. Makanin, G.S.: The problem of solvability of equations in a free semigroup. Mat. Sb. 103(2), 147–236 (1977)

    MathSciNet  Google Scholar 

  35. Massazza, P., Salmela, P.: On the simplest centralizer of a language. Theor. Inform. Appl. 40(2), 295–301 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  36. Okhotin, A.: Conjunctive grammars. J. Autom. Lang. Comb. 6(4), 519–535 (2001)

    MATH  MathSciNet  Google Scholar 

  37. Okhotin, A.: Conjunctive grammars and systems of language equations. Program. Comput. Software 28(5), 243–249 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  38. Okhotin, A.: Boolean grammars. Inform. and Comput. 194(1), 19–48 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  39. Okhotin, A.: On the equivalence of linear conjunctive grammars and trellis automata. Theor. Inform. Appl. 38(1), 69–88 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  40. Okhotin, A.: A characterization of the arithmetical hierarchy by language equations. Internat. J. Found. Comput. Sci. 16(5), 985–998 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  41. Okhotin, A.: Unresolved systems of language equations: Expressive power and decision problems. Theoret. Comput. Sci. 349(3), 283–308 (2005)

    MATH  MathSciNet  Google Scholar 

  42. Okhotin, A.: Strict language inequalities and their decision problems. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 708–719. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  43. Okhotin, A.: Computational universality in one-variable language equations. Fund. Inform. 74(4), 563–578 (2006)

    MATH  MathSciNet  Google Scholar 

  44. Okhotin, A.: Language equations with symmetric difference. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 292–303. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  45. Okhotin, A.: Nine open problems for conjunctive and Boolean grammars. Bull. EATCS 91 (to appear, 2007)

    Google Scholar 

  46. Okhotin, A.: Decision problems for language equations. Submitted for publication. Preliminary version. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 239–251. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  47. Okhotin, A., Yakimova, O.: Language equations with complementation: Decision problems. Theoret. Comput. Sci. (to appear)

    Google Scholar 

  48. Parikh, R., Chandra, A., Halpern, J., Meyer, A.: Equations between regular terms and an application to process logic. SIAM J. Comput. 14(4), 935–942 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  49. Plandowski, W.: An efficient algorithm for solving word equations. In: Proc. STOC’06, pp. 467–476. ACM, New York (2006)

    Google Scholar 

  50. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1–35 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  51. Ratoandromanana, B.: Codes et motifs. RAIRO Inform. Théor. Appl. 23(4), 425–444 (1989)

    MATH  MathSciNet  Google Scholar 

  52. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  53. Ruohonen, K.: A note on language equations involving morphisms. Inform. Process. Lett. 7(5), 209–212 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  54. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Masaryk University, Janáčkovo nám. 2a, 602 00 Brno, Czech Republic

    Michal Kunc

Authors
  1. Michal Kunc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tero Harju Juhani Karhumäki Arto Lepistö

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kunc, M. (2007). What Do We Know About Language Equations?. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73208-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73207-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation