Formal language theory is defined to be the study of sets of words over finite alphabets. In formal language theory a word in a language can be accepted by a device (automaton) or generated by a grammar. The four languages of the Chomsky hierarchy (regular, context free, context sensitive and recursively enumerable languages) are typically studied.
Subcategories 4
Related categories 1
Sites 6
Loading new listings for you to review...
- Formal Language Theory An introductory approach to the topic using many examples.
- A Hierarchy of Languages A brief discussion of context sensitive languages, recursively enumerable languages and languages with no grammars. Examples show these are not equivalent.
- Grammars A set of slides on grammars and language generation, with examples including a grammar for an abbreviated C language.
- Formal Language Theory for Natural Language Processing A draft manuscript with chapters on set theory, regular languages, context free languages and the Chomsky hierarchy.
- Grammars and Parsing Description of several types of formal grammars for natural language processing, parse trees, and a number of parsing methods.
- LING 106 Introduction to Formal Linguistics Lecture notes providing definitions, examples, theorems and problems. Course taught at University of Pennsylvania, Department of Linguistics.