 However, if left-regular rules and right-regular rules are combined, the language need no longer be regular.The rule formula_10 is also allowed here if formula_11 does not appear on the right side of any rule.These languages are exactly all languages that can be decided by a finite state automaton.