Questions related to formal languages, grammars, and automata theory
Formal languages are sets of strings, i.e. sequences over symbols from some alphabet.
In general, the field of formal languages studies mathematical and logical properties of and relationships between languages (or sets) of strings (or sequences of symbols) over alphabets (or sets of symbols). Commonly encountered varieties of formal languages are regular languages, context-free languages, context-sensitive languages, recursive languages, and undecidable languages.
Question about formal languages including automata theory, grammars.
Roughly corresponds to arXiv tagcs.FL and ACM Subject Classes F.1.1, and F.4.3.
The computability tag is better suited for question about computability and Turing machines.
Wikipedia
Related tags:
