edited by
660 views
0 votes
0 votes

let M be a finite autometa .let M' denote the machine obtained by interchanging the final and non final state

  1. L(M) U L(M') =sigma*
  2. L(M) $\cap$ L(M') =$\Phi$

how many statement is true 

and answer is both are true  .

no need to read the below part of the question because that is useless


i am sure that 1st is true 

but for 2nd take an example 

so 2nd become false but given that both are true for DFA 

where i am doing mistake  ??


i found my mistake that is i am changing initial state to final state and vice versa

but is should be  to find the complement we have to make non final state to final state and final to non final  and no other change

now the the correct image is 

so both statement is true

edited by

1 Answer

Related questions

0 votes
0 votes
1 answer
2
Rahul_Rathod_ asked Jul 24, 2018
528 views
check whether given language is regular or not 1) (an) n where n ≥12) ( am ) n where n ≥ 13) w= { (( a 2 ) n) * (( an )2 )* } where n ≥ 1
0 votes
0 votes
2 answers
3
4 votes
4 votes
1 answer
4
Garrett McClure asked Oct 9, 2017
1,262 views
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }.How do I show that the family of regular languag...