Questions tagged [finite-automata]
235 questions
0
votes
1 answer
For $n\ge 1$ let $A_n =\{w\in\{0,1\}^∗\mid w$ is a binary number that is a multiple of $n\}$, and prove that $A_n$ is regular.
For $n\ge 1$ let
$$A_n =\{w\in\{0,1\}^*\mid w\text{ is a binary number that is a multiple of }n\}\;.$$
Prove that $A_n$ is regular.
Hi. This is a problem for my finite automata class, so I don't expect an outright answer (though I wouldn't mind…
0
votes
1 answer
Finite automata
I want to ask about this statement.
"there exist finite automata that have a cycle, but still only accept a finite language"
is it true this statement? please give me a reason?
Thank you
0
votes
1 answer
The effect about empty string in NFA
I am learning Sipser's book "Introduction to the Theory of Computation" on automata theory. I am confused about the effect about empty string in NFA when reading the first chapter
There is a state diagram of nondeterministic finite automaton N1
If…
