Category:Formal languages

• Formal language

A

• Abstract syntax tree
• Algorithmic learning theory
• Ambiguous grammar
• Antimatroid
• Attribute grammar
• Augmented Backus–Naur form

B

• Backus–Naur form

C

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

D

• Diff

E

• Extended Backus–Naur form

F

• Free monoid

G

• Generalized star-height problem
• Greibach normal form

K

• Kleene algebra
• Kleene star

M

• Markup language
• Metacharacter
• Montague grammar
• Myhill–Nerode theorem

P

• Prefix grammar
• Probabilistic context-free grammar

Q

• Quotient of a formal language

R

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

S

• Star height
• Star height problem
• String (computer science)
• Syntactic monoid
• Syntax (logic)
• Formal system

T

• Tree automaton
• Turing machine

U

• Unary numeral system

W

• Well-formed formula