Intermediate
Discrete Mathematics & Math
Q51 / 100
What is a formal language in discrete mathematics?
Correct! Well done.
Incorrect.
The correct answer is B) A set of strings over an alphabet — the foundation of automata theory, compilers, and computability
B
Correct Answer
A set of strings over an alphabet — the foundation of automata theory, compilers, and computability
Explanation
Formal language L over alphabet Σ: L ⊆ Σ*. Operations: concatenation, union, Kleene star. Recognized by automata (FA for regular, PDA for CFL, TM for RE). Bridges discrete math and computability theory.
Progress
51/100