1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Formal Languages and Automata

  1. Oct 25, 2011 #1
    1. The problem statement, all variables and given/known data

    [PLAIN]http://img577.imageshack.us/img577/1948/dfav.jpg [Broken]

    3. The attempt at a solution

    For the first part, am I interpreting the langauage L correctly as words of length multiples of 4? Would the following DFA accept this L:
    [PLAIN]http://img685.imageshack.us/img685/6026/dfa2.jpg [Broken]

    For the 2nd part, is the language recognised by the DFA: [itex]L(\mathcal{A})=\{ab\}^{*} = \{ \varepsilon, ab, (ab)^2, (ab)^3, \cdots \} = \{ (ab)^n : n\geq 0 \}[/itex] ?

    How do I express the language recognised by the final DFA [itex]\mathcal{B}[/itex] ?
     
    Last edited by a moderator: May 5, 2017
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?



Similar Discussions: Formal Languages and Automata
  1. Finite Automata (Replies: 0)

  2. Formal power series (Replies: 0)

Loading...