Languages Defined by Generalized Equality Sets | SpringerLink
Skip to main content
Springer Nature Link
Log in

Languages Defined by Generalized Equality Sets

  • Conference paper
Fundamentals of Computation Theory (FCT 2003)

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

Included in the following conference series:

Abstract

We consider the generalized equality sets which are of the form E G (a,g 1,g 2) = { w | g 1(w) = ag 2(w)}, determined by instances of the generalized Post Correspondence Problem, where the morphisms g 1 and g 2 are nonerasing and a is a letter. We are interested in the family consisting of the languages h(E G (J)), where h is a coding and J is a shifted equality set of the above form. We prove several closure properties for this family.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ginsburg, S.: Algebraic and Automata-theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)

    MATH  Google Scholar 

  2. Halava, V., Harju, T., Hoogeboom, H.J., Latteux, M.: Valence Languages Generated by Generalized Equality Sets, Tech. Report 502, Turku Centre for Computer Science (August 2002) (submitted)

    Google Scholar 

  3. Harju, T., Karhumäki, J.: Morphisms. Handbook of Formal Languages. In: Rozenberg, G., Salomaa, A. (eds.), vol. 1, Springer, Heidelberg (1997)

    Google Scholar 

  4. Latteux, H., Leguy, J.: On the composition of morphisms and inverse morphisms. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 420–432. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  5. Latteux, H., Leguy, J.: On Usefulness of Bifaithful Rational cones. Math. Systems Theory 18, 19–32 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Păun, G.: A new generative device: valence grammars, Revue Roumaine de Math. Pures et Appliquées 6, 911–924 (1980)

    Google Scholar 

  7. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and TUCS – Turku Centre for Computer Science, University of Turku, FIN-20014, Turku, Finland

    Vesa Halava & Tero Harju

  2. Dept. of Comp. Science, Leiden University, P.O. Box 9512, 2300, RA, Leiden, The Netherlands

    Hendrik Jan Hoogeboom

  3. Université des Sciences et Technologies de Lille, Bâtiment M3, 59655 Cédex, Villeneuve d’Ascq, France

    Michel Latteux

Authors
  1. Vesa Halava
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tero Harju
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hendrik Jan Hoogeboom
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michel Latteux
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Lund University, 22100, Lund, Sweden

    Andrzej Lingas

  2. School of Technology and Society, Malmö University, SE-205 06, Malmö, Sweden

    Bengt J. Nilsson

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halava, V., Harju, T., Hoogeboom, H.J., Latteux, M. (2003). Languages Defined by Generalized Equality Sets. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45077-1_33

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45077-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation