Context-Free Languages. Presentation. Preliminaries
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.
KeywordsNoun Phrase Turing Machine Closure Property Connect Grammar Linear Language
Unable to display preview. Download preview PDF.