0 is regular 6. Let us introduce a function g:S o.1]. where g(r) -1 if e Fin and g(r) 0 otherwise Call a word Vo...ty EI nice if Is the language consisting of nice words regular? what ?s your q1e6 about more general weights, i.e. where J(d) is a given function with integer values. It is a bonus problem! Hint: 1 i 1is+1 you need to add extra states to take care of the addition modulo 8 and something else 2. The sevond part of the problen depends on the infnite secquence O)....Say, this sequence is periodic.... 7. Let us consider the unary case. Le. the alphabet I - Let L c. Describe unary languages in the plain English. Prove that if the matrix T has infinite number of distinct rows then all its rows are distinct. S. So, unary languages are just sets on integer mumbers (0 S num