I am sorry for possibly trivial questions: 1. Is the problem of equality of languages given by two regular expresions equal decidable? 2. Is there a (decidable) formal system for proving the above equalities? regards, Adam Kolany