Register

Reverse of language in TOC

2,380 views
1 votes
1 votes

If I have string 100 then it's reverse is 001, but when a string is 101 then how it's reverse is 101?

Reversal follow this rule - aWb ---> bWa then why in 101 we get 000?

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
sh!va asked Jun 21, 2016
1,831 views
Is this language regular? L1:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0},wR is the reverse of string w
Is this language regular? L1:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0}, wR is the reverse of string w Please explain..
Is this language regular? L1:{wxwR∣w,x∈{a,b}∗ and |w|,|x|>0},wR is the reverse of string wPlease explain..
User Avatar
1 votes
1 votes
1 answer
3
iarnav asked Sep 8, 2017
1,104 views
TOC Regular Language Question
Please ANSWER these?
Please ANSWER these?
User Avatar
3 votes
3 votes
3 answers
4
iarnav asked Aug 11, 2017
596 views
TOC What language is this?
The given set is 1,2,4,8, . . . . . 2^n in unary number system which is shown in BOLD below L = {1,11,1111,11111111, . . . . . . . . } Is it regular or CFL?
The given set is 1,2,4,8, . . . . . 2^n in unary number system which is shown in BOLD belowL = {1,11,1111,11111111, . . . . . . . . }Is it regular or CFL?
User Avatar
Link Copied!