a. Design a DFA over an alphabet {a, b} to recognize a language in which every a is followed by b

2.6kviews

written 8.7 years ago by

teamques10 ★ 70k

modified 3.8 years ago by

pedsangini276 • 4.8k

Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 5M

Year: Dec 2016

theory of computation

ADD COMMENT EDIT

1 Answer

105views

written 8.7 years ago by

teamques10 ★ 70k

Definition: DFA Consist of finite set of states, one state is called start state and there can be one/more final states.

Logic:

enter image description here

Implementation Implementation:

$M = (Q, Σ, Ґ, δ,q_0, z_(0 ), F )$

$Q = {q_0, q_1, q_f}$

$ Σ= {a, b}$

$Ґ = {X, R}$

$q_0 = q_0$ …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.