applied gate test
Register

applied gate test

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

1 Answer

0 votes
0 votes
12 states

--> 11states for accepting 1pow 10

      + 1state for trap
by
71 points

1 comment

by
5 points
@Onika, Can you elaborate ? i am getting 11 states, why is 1 state for trap needed ?
0
0
Ask a Question
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.
Developed by Chun
Link Copied!