Ask a Question

  1. Home
  2. Ask a Question
  3. Question Details
Doubts ?
Post a question
Ask Us

Categories

Q#2. Draw a Transition Graph (TG) for the language expressed by the following regular expression: ^ + 0(01 + 10)*1 + 1(10 + 01)*0

on 2012-10-30 21:12:05   by sam   on Computer Science & Engineering  0 answers