Skip to main content
SpringerLink
Log in

General solution of mirror equation

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 710))

Included in the following conference series:

  • 138 Accesses

Abstract

Words with lists of parameters are introduced in [7], where they are proposed (in a research project) to give a finite description of the set of all the solutions of a word equation.

This research project is introduced via a set of conjectures and no proved theorems, and offers some new bases to solve the very difficult problem of associative unification.

We prove in this paper the first one of these theorems allowing to describe the general solution of mirror equation without constants by words with lists of parameters.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Abdulrab. Résolution d'équations sur les mots: étude et implémentation LISP de l'algorithme de Makanin. (Thèse), Université de Rouen(1987). Et Rapport LITP 87-25, Université de Paris-7 (1987).

    Google Scholar 

  2. H. Abdulrab et J.P. Pécuchet. Solving Word Equations, JSC (1989) 8, 499–521. Appeared also in UNIFICATION, (edited by C. Kirchner, Academic Press, (1990)).

    Google Scholar 

  3. Yu.I. Khmelevskii. Equations in free semigroups. Trudy Mat. Inst. Steklov, 107, (1971).

    Google Scholar 

  4. A. Lentin. Equations dans le monoïde libre. Gauthier-Villars, Paris, (1972).

    Google Scholar 

  5. M. Lothaire. Combinatoriecs on Words. Addison-Wesley, (1983).

    Google Scholar 

  6. G.S. Makanin. The problem of solvability of equations in a free semigroup. Mat. Sb. 103 (145) (1977) p.147–236 English transl. in Math. USSR Sb. 32, (1977).

    Google Scholar 

  7. G.S. Makanin. On general solution of equations in free semigroups. Proceedings of IWWERT'91, Rouen, 667, LNCS (Lectures notes in computer science). Edited by H. Abdulrab et J.P. Pécuchet.

    Google Scholar 

  8. J.P. Pécuchet. Equations avec constantes et algorithme de Makanin. (Thèse), Université de Rouen, (1981).

    Google Scholar 

  9. G. Plotkin. Building-in equational theories. Machine Intelligence 7, p. 73–90. (1972).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIR/INSA de Rouen, BP 08, 76131, Mont Saint Aignan Cedex

    Habib Abdulrab & Marianne Maksimenko

  2. Institut Blaise Pascal, LITP, France

    Habib Abdulrab & Marianne Maksimenko

Authors
  1. Habib Abdulrab
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marianne Maksimenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdulrab, H., Maksimenko, M. (1993). General solution of mirror equation. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57163-6

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation