0 votes
0 votes
how many states are in smallest possible  DFA {0,1} * {$1^{10}$}
in Theory of Computation
by
5 points
40 views

1 Answer

0 votes
0 votes
12 states

--> 11states for accepting 1pow 10

      + 1state for trap
by
5 points
Ask
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.