### Assignment – 8 Regular Language & Finite Automata

**B. H. Gardi College of Engineering and Technology,Rajkot**

**Department of MCA**

**MCA Semester – II**

**Subject: 620007 – Theory of Computation**

__Assignment – 8__

__Regular Language & Finite Automata__

**Date: 17-Apr-2010**

1 | Regular Language |

2 | Regular Expression |

3 | Regular Language & Regular Expression Over Σ |

4 | Finite Automata / |

5 | Transition Table |

6 | Types of State |

7 | Transition Diagram |

8 | Transition Function ( δ ) |

9 | Extended Transition Function ( δ* ) |

10 | String Accepted by FA |

11 | String Rejected by FA |

12 | Regular Language ( In Context of FA) |

13 | Distinguishable String With Respect To Language |

__Note:__**Write all Answers with**.

*Example*
## Comments

## Post a Comment