173 views
1 votes
1 votes
for fintie autometa of n state the max lenght of string that must be consider to distinguish two state is-

1. n

2. n-1

3  n-2

4.none

1 Answer

Related questions

1 votes
1 votes
1 answer
1
Hira Thakur asked Aug 29, 2016
357 views
consider following input sequence 01010101............A) what will be regular expression to accept all prefixes of the given sequence__1. 0(10)*2. 0(01)*3. 0(10)*+(01)*4....
1 votes
1 votes
1 answer
2
Hira Thakur asked Aug 29, 2016
342 views
which of following regular expression generate the set of all string not cantaing "baa" as a substring over the input alphbet{a,b} is___1 a*(b*a*)2 a*b*ab3 a*baba*4 a*(ba...
4 votes
4 votes
0 answers
3
Hira Thakur asked Aug 29, 2016
799 views
if M1 machine recognizing L1 with n state the M recognizing L1* constructed using thomson construction will have minimum number of states1. n2 n+13. n+24. n-1
1 votes
1 votes
1 answer
4
Hira Thakur asked Aug 29, 2016
187 views
the left liner grammer given below genratesH→Ha/aS→Hb1.(a+b)^+2.aa*b3 a*b4 none