[Solved]: Is the intersection of two regular languages regular?

Problem Detail: 

Trivially decidable problem is one in which the problem is a known property of the language/grammar. So intersection of two regular languages is regular should be trivially decidable? But it is given as not trivially decidable.

Asked By : user1771809

Answered By : Yuval Filmus

Summarizing the discussion, the intersection of two regular languages is always regular, and so "trivially decidable".

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/7488