Skip to main content

Substring languages

  • Formal Languages
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. MAŁUSZYNSKI, J.: Subproblems of recognitions problems. Lecture Notes in Computer Science 2(1973), 294–300, (Proc. of 1GI Conf. on Formal Languages and Automata Theory). Springer-Verlag, Berlin-Heidelberg-New York 1973.

    Google Scholar 

  2. MAŁUSZYNSKI, J.: Regular structures in programming languages. Theory of Programming Languages Semantics and Compiling, (Proc. Conf., Frankfurt/Oder, 1974) — to appear in EIK

    Google Scholar 

  3. SALOMAA, A.: Formal languages. Academic Press, New York 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Małuszyński, J. (1975). Substring languages. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_686

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_686

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics