Category:Formal languages
Wikimedia Commons has media related to Formal languages.
Subcategories
This category has the following 13 subcategories, out of 13 total.
A
C
D
- Dependently typed languages (15 P)
G
- Graph rewriting (11 P)
L
- L-systems (10 P)
M
- Metalanguages (7 P)
P
- Problems on strings (11 P)
T
- Trace theory (8 P)
Pages in category "Formal languages"
The following 200 pages are in this category, out of approximately 201 total. This list may not reflect recent changes.
(previous page) (next page)A
- Abstract family of acceptors
- Abstract family of languages
- Abstract rewriting system
- Abstract semantic graph
- Abstract syntax tree
- Action algebra
- Adaptive grammar
- Affix grammar
- Agent Communications Language
- Algorithmic learning theory
- Alphabet (formal languages)
- Ambiguous grammar
- Antimatroid
- Arden's rule
- Attribute grammar
- Augmented Backus–Naur form
- Autocorrelation (words)
C
- Categorial grammar
- Chomsky hierarchy
- Chomsky normal form
- Chomsky–Schützenberger enumeration theorem
- Chomsky–Schützenberger representation theorem
- Closest string
- Compact semigroup
- Compiler Description Language
- Concatenation
- Cone (formal languages)
- Conference on Implementation and Application of Automata
- Conjunctive grammar
- Context-free grammar
- Context-free language
- Context-sensitive grammar
- Context-sensitive language
- Controlled grammar
- Critical exponent of a word
- Cross-serial dependencies
- Cyclic language
D
- Definite clause grammar
- Dershowitz–Manna ordering
- Descriptional Complexity of Formal Systems
- Descriptive interpretation
- Deterministic context-free grammar
- Deterministic context-free language
- Deterministic pushdown automaton
- Diff
- Discontinuous-constituent phrase structure grammar
- Dyck congruence
- Dyck language
E
F
G
I
L
- L-attributed grammar
- Language equation
- Language identification in the limit
- Left recursion
- Leftist grammar
- Lexical grammar
- Linear grammar
- Literal movement grammar
- LL grammar
- Local language (formal language)
- Locally catenative sequence
- Longest increasing subsequence
- Longest repeated substring problem
- LR-attributed grammar
M
P
- Parikh's theorem
- Parser combinator
- Parser Grammar Engine
- Parsing expression grammar
- Pattern language (formal languages)
- Picture language
- Post canonical system
- Prefix grammar
- Probabilistic context-free grammar
- Production (computer science)
- Profinite word
- Proof (truth)
- Pumping lemma for context-free languages
- Pumping lemma for regular languages
R
S
- S-attributed grammar
- SCIgen
- Semantics encoding
- Semi-Thue system
- Sesquipower
- Set constraint
- Shamir congruence
- Shortest common supersequence
- Signed-digit representation
- Simple precedence grammar
- SLR grammar
- Smallest grammar problem
- Sparse language
- Splicing rule
- Square-free word
- Star height
- Star height problem
- Star-free language
- Stochastic language
- Straight-line grammar
- String (computer science)
- String operations
- Substring
- Symbol (formal)
- Synchronous context-free grammar
- Syntactic monoid
- Syntactic predicate
- Syntax (logic)
- Syntax diagram
- Formal system