Category:Formal languages

• Formal language
• List of formal language and literal string topics

A

• Abstract semantic graph
• Abstract syntax tree
• Agent Communications Language
• Algorithmic learning theory
• Alphabet (formal languages)
• Ambiguous grammar
• Antimatroid
• Attribute grammar
• Augmented Backus–Naur form

B

• Backus–Naur form
• Bigram
• Boolean grammar

C

• Categorial grammar
• Chomsky hierarchy
• Chomsky normal form
• Concatenation
• Conjunctive grammar
• Context-free grammar
• Context-free language
• Context-sensitive grammar
• Context-sensitive language

D

• Definite clause grammar
• Deterministic pushdown automaton
• Diff
• Dyck language

E

• ECLR-attributed grammar
• Empty string
• Extended affix grammar
• Extended Backus–Naur form

F

• Finite thickness
• Formal proof
• Free monoid

G

• Generalized star-height problem
• Greibach normal form

I

• Introduction to Automata Theory, Languages, and Computation

K

• Kleene algebra
• Kleene star
• Kuroda normal form

L

• L-attributed grammar
• Language identification in the limit
• Left recursion
• Linear grammar
• Longest increasing subsequence
• Longest repeated substring problem
• LR-attributed grammar

M

• Markup language
• Matrix grammar
• Metacharacter
• Montague grammar
• MU puzzle
• Myhill–Nerode theorem

N

• Normal form (abstract rewriting)

O

• Ogden's lemma
• Omega language
• Omega-regular language
• Operator-precedence grammar

P

• Parsing expression grammar
• Prefix grammar
• Probabilistic context-free grammar
• Pumping lemma for context-free languages
• Pumping lemma for regular languages

Q

• Quasi-quotation
• Quotient of a formal language

R

• Recursive grammar
• Recursively enumerable language
• Regular expression
• Regular grammar
• Regular language
• Regular tree grammar
• Rewriting

S

• S-attributed grammar
• SCIgen
• Semantics encoding
• Semi-Thue system
• Shortest common supersequence
• Signed-digit representation
• Simple precedence grammar
• Smallest grammar problem
• Square-free word
• Star height
• Star height problem
• Star-free language
• String (computer science)
• Substring
• Syntactic monoid
• Syntax (logic)
• Formal system

T

• Terminal yield
• Top-down parsing language
• Tree automaton
• Turing machine

U

• Unary numeral system
• Unrestricted grammar

V

• Van Wijngaarden grammar

W

• Well-formed formula
• Wirth–Weber precedence relationship