Details of this Paper

Given a NFA A and a regular expression B, consider the problem of determining if L(A) = L(B).

Description

solution


Question

Given a NFA A and a regular expression B, consider the problem of determining if L(A) =;L(B). Is this decidable? Prove your answer.

 

Paper#18923 | Written in 18-Jul-2015

Price : $42
SiteLock