1. Engineering
  2. Computer Science
  3. show an finite state machine deterministic or nondeterministic that accepts...

Question: show an finite state machine deterministic or nondeterministic that accepts...

Question details

Show an Finite State Machine (deterministic or nondeterministic) that accepts L={ω∈a,b,c*: ω contains at least one substring that consists of three identical symbols in a row}. For example:

The following strings are in L:aabbb, baacccbbb.

The following strings are not in L: ε, aba, abababab, abcbcab.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution