Computer Science, asked by kavyadivvi123, 6 months ago

construct finite automaton that recognizes the language over the alphabet {a, b, c} of all string not containing substring ba​

Answers

Answered by ksovinder
0

Answer:

cant understand your question

Similar questions