Show that {abc,bca,cab} can be generated by regular grammar whose terminal set is {a,b,c}
Since, a dfa can be constructed for the above set of strings, therefore the set of strings can be generated using regular grammar
