Skip to main content

Formal parametric equations

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

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

Included in the following conference series:

Abstract

The goal of this article is to present formal parametric equations, used as a new tool for the computation of the general solution of word equation. The computation of the general solution is reduced here to the computation of a finite graph whose nodes are families of formal parametric equations, and whose arcs are labelled by some powerful transformations that can replace arbitrary long sequences of elementary transformations.

The main concepts (tables of polarisation, formal parametric transformations) and ideas of our approach are presented and demonstrated for the computation of a finite graph describing the general solution of word equations with three variables.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. General Solution of Mirror Equations. H. Abdulrab et M. Maksimenko. Proceedings of FCT'93 (Fundamentals of Computation Theory). Springer Verlag, LNCS. n: 710, Edited by Prof. Esik, p.p. 133–142.

    Google Scholar 

  2. General Solution of Systems of Linear Diophantine Equations and Inequations. H. Abdulrab and M. Maksimenko, Rewriting Techniques and Applications. Springer Verlag, LNCS. n: 914, Edited by Jieh Hsiang, p.p. 339–351.

    Google Scholar 

  3. Equations dans le Monode Libre. A. Lentin, Gauthier-Villars, Paris 1972.

    Google Scholar 

  4. Combinatorics on Word. M. Lothaire, chapter 9, by C. Choffrut, Addisson-Wesley, 1983.

    Google Scholar 

  5. The Systems of Standard Word Equations in the n-layer Alphabet of Variables. (in Russian) G.S. Makanin, Sibirski matematictheski journal, AN SSSR, Sibirskoje otdelenije, vol. XIX, N 3, 1978.

    Google Scholar 

  6. On general solution of equations in a free semigroup. G.S. Makanin, Proceedings of IWWERT'91, Rouen, 667, LNCS. Edited by H. Abdulrab and J.P. Pecuchet, 1991.

    Google Scholar 

  7. Transformations of Word Equations with Three Variables: Rouen's Function. G.S. Makanin, and H. Abdulrab, Rapport LITP 93.44, July 93.

    Google Scholar 

  8. On General Solution of Word Equations. G.S. Makanin, and H. Abdulrab, Proceedings of ”Important Results and Trends in Theoretical Computer Science”, LNCS, N. 812. P.P. 251–263.

    Google Scholar 

  9. Bunches of Formal Parametric Equations with Three Variables. G.S. Makanin, H. Abdulrab and M.N. Maksimenko, LIR, Research rapport, 1994.

    Google Scholar 

  10. Building-in Equational Theories., G. Plotkin, Machine Intelligence 7, P. 73–90, 1972.

    Google Scholar 

  11. Unification Theory: a survey. J. Siekmann, in C. Kirchner (Ed.), Special Issue on Unification, JSC 7, 1989 7, P. 73–90, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Makanin, G.S., Abdulrab, H., Maksimenko, M.N. (1995). Formal parametric equations. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60249-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics