Bazsites.com Formal Language Theory
Directory Topics
On the Web
- Turing Machines and Type 0 Languages - Two theorems which show that the class of languages accepted by Turing machines is the class of Type 0 or recursively enumerable languages.
- Formal Grammars and Languages - A survey article on formal systems that define families of formal languages arising in many computer science applications with primary focus on context-free languages.
- Formal Language Theory - A lecture on grammars, generating languages from grammars, the Chomsky classification and derivation trees.
- Formal Language Theory for Natural Language Processing - No description
- Formal Language Theory and Parsing - This site includes chapters on regular and context-free languages as well as bottom-up and top-down parsing using LR(k) parsers.
- Formal Languages and Compilers - Course notes onthe definition of formal languages and the use of context free languages in compiler construction.
- Formal Language Theory - An introductory approach to the topic using many examples.
- Regular Language - Basic definitions of regular languages, how they are generated, closure properties, and comparison with context free languages.
- Recursively Enumerable Languages - This chapter shows that the family of regular languages is a proper subset of context free languages and the latter is a proper subset of recursively enumerable languages.
- Context Free Grammars and Languages - Article defines terms and proves that context free languages are accepted by pushdown automata. It also gives examples from programming languages and discusses closure properties.
Wikipedia Articles
- Automata theory - In theoretical computer science, automata theory is the study of abstract machines and problems they are able to solve. Automata theory is closely related to formal language theory as the automata are often classified by the class of formal languages they are able to recognize.
- Unary language - In computational complexity theory, a unary language or tally language is a formal language (a set of strings) where all strings have the form 1k, where "1" can be any fixed symbol. For example, the language {1, 111, 1111} is unary, as is the language {1k | k is prime}.
- Pumping lemma - In the theory of formal languages in computability theory, a pumping lemma states that any language of a given class can be "pumped" and still belong to that class. A language can be pumped if any sufficiently long string in the language can be broken into pieces, some of which can be ...
- Type theory - In mathematics, logic and computer science, type theory is any of several formal systems that can serve as alternatives to naive set theory, or the study of such formalisms in general. In programming language theory, a branch of computer science, type theory can refer to the design, analysis and study of type systems, although some computer scientists limit the term' ...
- Cointerpretability - In mathematical logic, cointerpretability is a binary relation on formal theories: a formal theory T is cointerpretable in another such theory S, when the language of S can be translated into the language of T in such a way that S proves every formula whose translation is a theorem of T. The "translation" here is required to preserve the logical ...