..........................................NEXT PREVIOUS INDEX
L04 FSA: Combining FSAs: Union Combining FSAs: Union o Union of two languages L1, L2: L1 U L2 = { s | s IN L1, or s IN L2} o If F1, F2 are FSAs for above languages with initial states qs and qt, - introduce new initial state, - draw 0-transitions from the new initial state to old initial states qs and qt: 0 |----->----(qs)-> ... ->(q)--| |----->----(qt)-> ... 0..........................................NEXT PREVIOUS INDEX