FSM can't remember arbitrarily large of information

FSM can't deterministically fix the mid-point

even if midpoint is known, FSM be can't be found whether, second half of the string matches the first half

all of these

35

360

49

720

context- free

context-sensitive

recursive

Right-linear

NO

YES

SOMETIMES

Depends on NFA

The language accepted by finite automata are the languages denoted by regular expressions

For every DFA there is a regular expression denoting its language

For a regular expression r, there does not existNFA with L(r)any transit that accept

None of these