Yes, your context-free grammar is in Chomsky Normal Form.
A grammar is in CNF whenever its rules are of one of two types, either $A\to BC$ or $A\to a$, where $A,B,C$ are nonterminals, and $a$ is a terminal symbol.
This means that every context-free grammar is equivalent to a cf grammar in CNF, up to the empty word.
This means that by conversion into CNF ...
To simplify, let’s only speak about decision problems.
Decision problems have yes or no answers.
For example; Is X prime? Is a decision problem.
We can re-formulate the following question to be a set membership problem.
We define a language L to be the set of all prime numbers, ie the set of all strings that would make the decision problem return yes. ...
In Fourier analysis we realized that we could represent any kind of periodic functions with sine and cosine functions.
Signals are functions that represent a variable with respect to another variable that is usually time.
So instead of sending different signals (data) over and over again we could think of them all as sine functions with some differences, so ...
CS isn't neatly divided into "applied" and "theoretical". Work that seeks to build systems and solve practical problems tends to get described as "applied"; work that seeks to increase our knowledge of computation tends to get described as "theoretical". Machine learning covers a spectrum that includes both.
If somebody said to me "I'm a theoretical ...