The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _____________ a*b*(ba)*a*

The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _____________

a*b*(ba)*a*

(a) 2

(b) 3

(c) 4

(d) 5

This question was posed to me in an internship interview.

My enquiry is from Minimization of DFA topic in portion Finite Automata and Regular Expression of Compiler

The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _____________ ab(ba)a

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Related questions

Most popular tags