The Gateway to Computer Science Excellence
0 votes
329 views

Use the procedure described in $\text{Lemma 1.55}$ to convert the following regular  expressions to non-deterministic finite automata.

  1. $(0\cup 1)^{*}000(0\cup 1)^{*}$
  2. $(((00)^{*}(11))\cup 01)^{*}$
  3. $\phi^{*}$
in Theory of Computation by | 329 views

1 Answer

0 votes

a. (0+1)*000(0+1)*

b. ((00)*11+01)*

c. ϕ*=ε

by
edited by

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
52,345 questions
60,471 answers
201,797 comments
95,273 users