How do we prove two languages are equal ?
I feel by assuming symmetric difference of both languages and if the resulting dfa is empty then we have our solution ! So i need a to know how to find symmetric difference of two languages
many ways of doing it, including comparing their minimal DFAs. See http://www.dcc.fc.up.pt/~nam/publica/jalc.pdf for related work on this.
Dear Sadvi ramana Thotapalli,
Certainly, the application of deterministic finite automaton can be utilized to specify equivalence across regular languages. For more information, I refer you to the following links:
Best regards,
R. Biria
http://www.cis.upenn.edu/~jean/gbooks/toc.pdf
http://www.sti.uniurb.it/aldini/publications/lfga.pdf
http://michael.cadilhac.name/public/writings/05-cover-automata.pdf
- Badges
- Science topic
- Similar topics
- Linguistics