Skip to main content
SpringerLink
Log in

Adherence equivalence is decidable for DOL languages

  • Contibuted Papers
  • Conference paper
  • First Online:
STACS 84 (STACS 1984)

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

Included in the following conference series:

Abstract

A procedure is given for deciding whether or not the languages generated by an arbitrary pair of DOL systems have the same adherence.

From arbitrary DOL systems simpler systems are constructed which have the same adherences as the original systems. Representations of the sequences in the adherences of these simpler systems are constructed. Such sequences either have the form uvω for finite strings u and v or they have a form widely discussed by A.Salomaa: wsh(s)h2(s)...hn(s) ... where h is an endomorphism of A⋆ and h(w)=ws. The problem of deciding equality of two sequences of the latter type was recently solved by K.Culik II and T.Harju and their algorithm is a major tool used here.

Correspondence with Karel Culik II during the early stages of the present work was helpful and encouraging.

This research was supported in part by Grants MCS-8003348 and MCS-8303922 of the National Science Foundation of the United States of America.

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. J. Beauquier and M. Nivat, Application of formal language theory to problems of security and synchronization, in: R.V. Book, Ed., Formal Language Theory (Academic Press, New York, 1980).

    Google Scholar 

  2. L. Boasson and M. Nivat, Adherences of languages, J. Computer and System Sciences 20(1980)285–309.

    Google Scholar 

  3. K.Culik II and T.Harju, The ω-sequence equivalence problem for DOL systems is decidable, J. Assoc. Computing Machinery, to appear; see also: Proc. 13th ACM Symposium on the Theory of Computing (1981)1–6.

    Google Scholar 

  4. K. Culik II and A. Salomaa, On infinite words obtained by iterating morphisms, Theor. Computer Science 19(1982)29–38.

    Google Scholar 

  5. T.Head, Adherences of DOL Languages, Theor. Computer Science, to appear in 1984.

    Google Scholar 

  6. G.T. Herman and G. Rosenberg, Developmental Systems and Languages (North Holland/American Elsevier, New York, 1975).

    Google Scholar 

  7. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems (Academic Press, New York, 1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, University of Alaska, 99701, Fairbanks, Alaska, USA

    Tom Head

Authors
  1. Tom Head
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Fontet K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Head, T. (1984). Adherence equivalence is decidable for DOL languages. In: Fontet, M., Mehlhorn, K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-12920-0_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12920-2

  • Online ISBN: 978-3-540-38805-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation