Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
strings over some finite alphabet and are formed to a specific set of rules. For example a language L over the alphabet Σ = {0, 1, 2, -, =} can have the following grammar: Every non-empty string that does not contain “-” or “=” and does not start with “0” is in L A string containing “=” is in L if