Skip to main content

Posts

Showing posts from November, 2014

Finite Automata to CFG or Grammar...how?????

QUESTION is L=(AB)+  where A=11|10 and B=000|110 Download JFLAP from www. jflap .org/ jflap tmp/ Then Windows_Button+R ie; RUN Type cmd or command Then type java –jar <filename.jar> L=(AB)+      where A=11|10 and B=000|110 From this ….. Before design …what we need….Our question is L=(AB)+  where A=10|11 and B=110|000. W={10110,10000,11110,11000,1011010110,1000010000,……..} First I drawn the diagram based on first four inputs….Then I drawn an epsilon state to Initial state. How to write CFG(Grammar):- q0 as S,q1 as A and so on. S -> 1A A -> 1B | 1A B -> 1C | 0C C -> 1D | 0D           D -> 0E               E -> S | epsilon