Formal Language Theory
E822916
Formal Language Theory is a branch of computer science and mathematics that studies abstract languages and the automata or grammars that define and recognize them.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Formal Language Theory canonical | 1 |
Statements (52)
| Predicate | Object |
|---|---|
| instanceOf |
academic discipline
ⓘ
subfield of mathematics ⓘ subfield of theoretical computer science ⓘ |
| appliedIn |
lexical analysis
ⓘ
model checking ⓘ parsing ⓘ pattern matching ⓘ protocol verification ⓘ |
| characterizedBy |
use of algebraic methods
ⓘ
use of combinatorial methods ⓘ use of logical methods ⓘ |
| focusesOn |
complexity of language recognition
ⓘ
computational properties of languages ⓘ decidability questions ⓘ expressive power of formalisms ⓘ syntax of languages ⓘ |
| goal |
classify languages by generative and recognitive power
ⓘ
understand limits of algorithmic language processing ⓘ |
| hasKeyConcept |
Myhill–Nerode theorem
NERFINISHED
ⓘ
automaton model ⓘ closure properties ⓘ decision problems ⓘ equivalence of formalisms ⓘ grammar type ⓘ language class ⓘ pumping lemma ⓘ |
| historicallyInfluencedBy |
Noam Chomsky
NERFINISHED
ⓘ
automata theory of the 1950s ⓘ |
| includes |
Chomsky hierarchy
NERFINISHED
ⓘ
theory of context-free languages ⓘ theory of context-sensitive languages ⓘ theory of recursively enumerable languages ⓘ theory of regular languages ⓘ |
| relatedTo |
automata theory
NERFINISHED
ⓘ
compiler construction ⓘ complexity theory ⓘ computability theory ⓘ formal verification ⓘ natural language processing ⓘ programming language theory ⓘ |
| studies |
automata
ⓘ
formal languages ⓘ grammars ⓘ language generation ⓘ language recognition ⓘ |
| uses |
Turing machines
NERFINISHED
ⓘ
finite automata ⓘ formal grammars ⓘ linear bounded automata ⓘ logic formalisms ⓘ pushdown automata ⓘ regular expressions ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.