The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
25 views

Use the construction given in $\text{Theorem 1.39}$ to convert the following two non-deterministic finite automata to equivalent deterministic finite automata.

asked in Theory of Computation by Boss (36.4k points) | 25 views

1 Answer

0 votes

a)

  a b

1

2

1,2

-

2

1

 

DFA transition table

  a b

1

[12]

2

Ф

[12]

[12]

Ф

Ф

2

[12]

1

Ф

 

in the DFA initial state is 1 and final states are 1 and [12]

answered ago by Active (3.5k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,434 questions
53,630 answers
186,007 comments
70,899 users