Fundamentals of Discrete Mathematics

Unit $5$: Introduction to Automata and Additional Topics in Discrete Math

Learning map

Learn: Automata Theory

rn: Automata Theory

Contact

Extras

path

Question $4$

Suppose a finite$-$state machine $($FSM M$)$ accepts a fixed string W over $.$ For example, $$ could be all the letters of the alphabet, a through $z,$ and $M$ will just accept the word "mountain". If the length of $W$ is $n,$ the minimum number of states required

$n-1$

$$ I don't know

You answered $3$ out of $3$ correctly. Asking up to $10.$

back skipped

section

Submit answer