To keep the answer short:

In LTL there are usually no quantifiers "A" or "E" as LTL was designed to talk about paths and thus it only consists of path formulas. According to this definition you are only allowed to use one quantification (a universal) on the outermost level to make it possible to use LTL to reason about states. Thus:

If your formula contains no "A" or "E" => LTL

If your formula starts with an "A" and contains no "A" or "E" otherwise => LTL

In CTL every temporal operator needs to be quantified, so in front of every "G", "F", "X", "[x __U__ y]", "[x U y]", "[x __B__ y]", "[x B y]", "[x __W__ y]" or "[x W y]" (as well as the arrow variants) with x, y being other state formulas there needs to be either an "A" or an "E" quantifier. For this reason CTL can be transformed to mu-calculus easily as each quantified temporal operator is a state formula and thus can be described by a mu-calculus formula describing the exact same states. Thus:

If every temporal operator has an "A" or "E" directly in front of it => CTL

Due to these two definitions, LTL and CTL are almost contrary languages with the one describing "only" paths and the other one describing only states. Thus a translation is needed from one to the other while preserving the meaning which is not always possible.

CTL* on the last side combines both, so there are no restrictions on whether a quantification must be there or must not be there, thus every syntactically "correct" formula is at least a CTL* formula (without going into detail, "correct" means that the formula as constructed has a logical meaning behind it, so [x UU y] is of course not "correct").