Skip to main content
Log in

The Thue problem and logical specifications of derivation in formal systems

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Mechanisms different from the well-known DOL-systems are proposed for construction of cube-free words. A generator is presented, which is described by logical programming means and models the process of derivation in arbitrary grammars.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Salomaa, Jewels of Formal Language Theory [Russian translation], Mir, Moscow (1986).

    Google Scholar 

  2. R. Smullyan, Theory of Formal Systems [Russian translation], Nauka, Moscow (1981).

    MATH  Google Scholar 

  3. V. M. Giushkov, G. E. Tscitlin, and E. L. Yushchenko, Algebra, Languages, and Programming [in Russian], Naukova Dumka, Kiev (1989).

    Google Scholar 

  4. A. V. Gladkii, Formal Grammars and Languages [in Russian], Nauka, Moscow (1973).

    Google Scholar 

  5. W. F. Clocksin and C. S. Mellish, Programming in Prolog, Springer-Verlag (1987).

  6. J. Stobo, Problem Solving with Prolog [Russian translation], Radio i Svyaz (1993).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 18–25, November–December, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Provotar, A.I., Adnan, A. The Thue problem and logical specifications of derivation in formal systems. Cybern Syst Anal 35, 860–866 (1999). https://doi.org/10.1007/BF02742276

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02742276

Keywords

Navigation