Advertisement

Context-Free Languages. Presentation. Preliminaries

  • Maurice Gross
  • André Lentin

Abstract

In the course of the introductory chapters we have presented a language as a part of a free monoid generated by the letters of an alphabet (the words of a vocabulary) and a grammar as an algorithm which allows the words (the sentences) of a language to be enumerated. We also underlined the interest of an algorithm which, given a word (a sentence), would decide whether it belongs to the language or not.

Keywords

Noun Phrase Turing Machine Closure Property Connect Grammar Linear 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.

Copyright information

© Springer-Verlag Berlin · Heidelberg 1970

Authors and Affiliations

  • Maurice Gross
    • 1
  • André Lentin
    • 1
  1. 1.Institut Blaise PascalParisFrance

Personalised recommendations