Category:Formal languages
Wikimedia Commons has media related to Formal languages.
Subcategories
This category has the following 13 subcategories, out of 13 total.
Next items are not visible in browsers without Javascript
Next items are not visible in browsers without Javascript
Pages in category "Formal languages"
The following 199 pages are in this category, out of 199 total.
Next items are not visible in browsers without Javascript
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
E
G
I
L
- L-attributed grammar
- Language equation
- Language identification in the limit
- Language-Theoretic Security
- 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
- Semilinear set
- Sesquipower
- Set constraint
- Shortest common supersequence
- Signed-digit representation
- Simple precedence grammar
- SLR grammar
- Smallest grammar problem
- Sparse language
- Splicing language
- Square-free word
- Star height
- Star height problem
- Star-free 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
T
Next items are not visible in browsers without Javascript
This category content has been reduced to only pages contained in the ZIM file.