Register

Post Corresponds Problem

• recategorized by
715 views

1 Answer

0 votes
0 votes

solution is C forming a string 11100111

 

Sequence 1 2 3
A 1 110 0111
B 111 001 11
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Parshu gate asked Nov 19, 2017
1,635 views
Post correspondence problem
User Avatar
1 votes
1 votes
1 answer
2
Aditya asked Jul 30, 2015
2,014 views
Please post the DFA for the language.
What are the number of final states in minimal DFA, where $\Sigma = \{a,b\}$, if every string starts with "aa" and length of string is not congruent to 0 mod 4? 7 6 3 5
What are the number of final states in minimal DFA, where $\Sigma = \{a,b\}$, if every string starts with "aa" and length of string is not congruent to 0 mod 4?7635
User Avatar
0 votes
0 votes
2 answers
4
Nihal Singh asked Feb 26, 2022
1,140 views
Post Gate
Hi Everyone, I used many predictors, for Gate 2022, and it’s around 750-770. But I know, it is not enough for any good college. But I would be glad to have some guidance, what should I do now ?
Hi Everyone,I used many predictors, for Gate 2022, and it’s around 750-770. But I know, it is not enough for any good college. But I would be glad to have some guidance...
User Avatar
Link Copied!