Introduction to formal languages

  • Yu. I. Manin
Part of the Graduate Texts in Mathematics book series (GTM, volume 53)

Abstract

Let A be any abstract set. We call A an alphabet. Finite sequences of elements of A are called expressions in A. Finite sequences of expressions are called texts.

Keywords

Formal Language Atomic Formula Riemann Hypothesis Homological Algebra Unordered Pair 
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.

Copyright information

© Springer Science+Business Media New York 1977

Authors and Affiliations

  • Yu. I. Manin
    • 1
  1. 1.V. A. Steklov Mathematical Institute of the Academy of SciencesMoscowUSSR

Personalised recommendations