The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+25 votes
The length of the shortest string NOT in the language (over $\Sigma = \{a, b\})$ of the following regular expression is _______.
asked in Theory of Computation by Veteran (115k points)
edited by | 2.6k views
can anyone give nfa for this regular expression?

4 Answers

+60 votes
Best answer

$R = a^*b^*(ba)^*a^*$

for finding shortest string that is not in language it is better to look strings of length $0$, then of length $1$ and so on 

$\text{length}0 \{ \epsilon \}$  is in $L$

$\text{length}1 \{a, b\}$      all belong to $L$

$\text{length}2 \{aa, ab, ba, bb\}$      all belong to $L$

$\text{length}3 \{aaa, aab, aba, abb, baa, bab, bba, bbb\}$  bab does not belong to L

answered by Veteran (55.9k points)
edited by

Praveen Saini  how did u get this?

0 length strings over {a,b} = $(a+b)^0= \epsilon$

1 length strings over {a,b} = $(a+b)^1=a,b$

2 length strings over {a,b} = $(a+b)^2= (a+b)(a+b)= aa,ab,ba,bb$.

so on

 @Praveen Saini why r  u not finding the language derived from R = a*b*(ba)*a* and complement it! can this be an approach ?


yes that is same thing, you can find language of R, L(R), then complement, L'(R), then first element of L(R') will be bab.

Good Explanation

@praveen Saini .i didn't get that approach compliment one .can u please elaborate!!!!!!!!!

although i understand the given
Please draw once then explain m not getting how to solve this???
can u draw finite automata for the regular expression?

@suneetha @ Ankit @ Phalkey

In the DFA of the language (for given regular expression), shortest string that is NOT belong to the Language is,the shortest string that reach to a non-final state from the start state $q_0$.



I hope now it is clear that $bab$ is the answer

+10 votes

The big give away is the concatenation (ba)*  followed by a*

answered by Junior (879 points)
+7 votes
the shortest length is 3.

answer:- "bab"
answered by Boss (19.9k points)
+6 votes
To be completely sure of the right answer, construct an ɛ-NFA for the given language, convert it into an equivalent DFA and then complement it. The answer comes out to be bab.
answered by Active (1.7k points)
@Vishal please explain with Diagram ..

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,068 questions
53,206 answers
70,419 users