Which of the below statements on computational complexity theory foundations are correct Both the FSM and FSA acronyms refer to the same concept, the Finite State Machine $($Automaton$).$ Two grammars generating the same language may not be equivalent. In regular expressions star and union operators bind tighter than the concatenation operator. Only certain relation symbols have arity.