The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
  1. Give an $NFA$ recognizing the language $(01 ∪ 001 ∪ 010)^{*}.$
  2. Convert this $NFA$ to an equivalent $DFA.$ Give only the portion of the $DFA$ that is reachable from the start state.
in Theory of Computation by Boss (43.6k points) | 42 views

1 Answer

0 votes

a) NFA

by Active (3.9k 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
49,807 questions
54,727 answers
79,842 users