The Gateway to Computer Science Excellence
0 votes

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 Veteran (54.8k points) | 84 views

1 Answer

0 votes

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

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

c. ϕ*=ε

by Active (5.1k points)
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
50,647 questions
56,508 answers
100,966 users