Advertisement

Substring languages

  • J. Małuszyński
Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 28)

Keywords

Regular Language Free Language Leftmost Derivation Chomsky Normal Form Substring Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    MAŁUSZYNSKI, J.: Regular structures in programming languages. Theory of Programming Languages Semantics and Compiling, (Proc. Conf., Frankfurt/Oder, 1974) — to appear in EIKGoogle Scholar
  3. [3]
    SALOMAA, A.: Formal languages. Academic Press, New York 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • J. Małuszyński
    • 1
  1. 1.Computation Centre Polish Academy of SciencesWarsaw PKiN

Personalised recommendations