Skip to main content
Springer Nature Link
Log in

The unification problem for one relation Thue Systems

  • Conference paper
  • First Online:
Artificial Intelligence and Symbolic Computation (AISC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1476))

  • 114 Accesses

Abstract

We give an algorithm for the unification problem for a generalization of Thue Systems with one relation. The word problem is a special case. We show that in many cases this is a decision procedure with at most an exponential time bound. We conjecture that this is always a decision procedure.

This work was supported by NSF grant number CCR-9712388 and partially done while visiting INRIA Lorraine and CRIN.

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. S. Adian. Definining relations and algorithmic problems for groups and semigroups. Trudy Matem. in-ta im. Steklova AN SSSR, 85, 1996 (Russian).

    Google Scholar 

  2. S. Adian. Transformations of words in a semigroup presented by a system of defining relations. Algebra i logika, 15(6),611–621, 1976 (Russian).

    MathSciNet  Google Scholar 

  3. S. Adian, and G. Oganesian. On the word and divisibility problems in semigroups with a single defining relation. Izv. An. SSSR Ser. Matem., 42(2),219–225, 1978 (Russian).

    Google Scholar 

  4. J. Bouwsma. Semigroups Presented by a Single Relation. PhD dissertation at Pennsylvania State University, 1993.

    Google Scholar 

  5. C. Kirchner. Computing unification algorithms. In Proceedings of the First Symposium on Logic in Computer Science, Boston, 200–216, 1990.

    Google Scholar 

  6. G. Lallement. The word problem for Thue rewriting systems. In Spring School in Rewriting, ed. H. Comon and J. P. Jouannaud, Lecture Notes in Computer Science, 1994.

    Google Scholar 

  7. C. Lynch. Goal Directed Completion using SOUR Graphs. In Proceedings of the Eighth International Conference on Rewriting Techniques and Applications (RTA), Sitges, Spain, June 2–4, 1997.

    Google Scholar 

  8. W. Magnus. Das IdentitÄtsproblem für Gruppen mit einer definierenden Relation. Math Ann., 106,295–307, 1932.

    Article  MATH  MathSciNet  Google Scholar 

  9. Y. Matisaevich. Simple examples of unsolvable associative calculi. Dokl. Akad. Nauk. SSSR, 173,1264–1266, 1967.

    MathSciNet  Google Scholar 

  10. R. McNaughton. Well-behaved derivations in one-rule Semi-Thue Systems. Tech. Rep 95-15, Dept. of Computer Science, Rensselaer Polytechnic Unstitute, Troy, NY, Nov. 1995.

    Google Scholar 

  11. W. Savitch. How to make arbitrary grammars look like context-free grammars. SIAM Journal on Computing, 2(3),174–182, September 1973.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Clarkson University, Box 5815, 13699-5815, Potsdam, NY, USA

    Christopher Lynch

Authors
  1. Christopher Lynch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet Jan Plaza

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lynch, C. (1998). The unification problem for one relation Thue Systems. In: Calmet, J., Plaza, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 1998. Lecture Notes in Computer Science, vol 1476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055913

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics