Skip to main content
SpringerLink
Log in
Book cover

Combinatorics on Words pp 229–237Cite as

Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants

  • Conference paper

  • 494 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8079))

Abstract

A non-erasing morphism is weakly unambiguous with respect to a pattern if no other non-erasing morphism maps the pattern to the same image. If the size of the target alphabet is at least three, then the patterns for which there exists a length-increasing weakly unambiguous morphism can be characterized using the concept of loyal neighbors of variables. In this article this characterization is generalized for patterns with constants. Two different generalizations are given for sets of patterns.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   72.00
Price excludes VAT (USA)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2010)

    Google Scholar 

  2. Freydenberger, D., Nevisi, H., Reidenbach, D.: Weakly unambiguous morphisms. Theoret. Comput. Sci. 448, 21–40 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Freydenberger, D., Reidenbach, D.: The unambiguity of segmented morphisms. Discrete Appl. Math. 157(14), 3055–3068 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Freydenberger, D., Reidenbach, D., Schneider, J.: Unambiguous morphic images of strings. Internat. J. Found. Comput. Sci. 17(3), 601–628 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Harju, T., Karhumäki, J.: Morphisms. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 439–510. Springer (1997)

    Google Scholar 

  6. Head, T.: Fixed languages and the adult languages of 0L schemes. Int. J. Comput. Math. 10(2), 103–107 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mateescu, A., Salomaa, A.: Aspects of classical language theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 175–251. Springer (1997)

    Google Scholar 

  8. Reidenbach, D.: Discontinuities in pattern inference. Theoret. Comput. Sci. 397(1-3), 166–193 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Reidenbach, D., Schneider, J.: Restricted ambiguity of erasing morphisms. Theoret. Comput. Sci. 412(29), 3510–3523 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Schneider, J.: Unambiguous erasing morphisms in free monoids. RAIRO Inform. Theor. Appl. 44(2), 193–208 (2010)

    Article  MATH  Google Scholar 

  11. Shallit, J., Wang, M.W.: On two-sided infinite fixed points of morphisms. Theoret. Comput. Sci. 270(1-2), 659–675 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Turku, FI-20014, Turku, Finland

    Aleksi Saarela

Authors
  1. Aleksi Saarela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  2. University of Turku, 20014, Turku, Finland

    Arto Lepistö

  3. FUNDIM, University of Turku, Finland

    Luca Zamboni

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saarela, A. (2013). Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds) Combinatorics on Words. Lecture Notes in Computer Science, vol 8079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40579-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40579-2_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40578-5

  • Online ISBN: 978-3-642-40579-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation