Question

In this assignment, you wil implement a deterministic finite automata (DFA) using C++ programming language to extract matching patterns from a given input DNA sequence string. 1. Design a deterministic finite automata to recognize the regular expression A(A+T+G+C)*A + T(A+T+G+C)*T over the alphaber (A,T,G,C). This regular expression recognize any string that starts and ends with 'A' or starts and ends with 'T. or starts and ends with T

Answer 1

C++ CODE:

******************************************************

#include <bits/stdc++.h>
using namespace std;

int countSubstringWithEqualEnds(string s)
{
int result = 0;
int n = s.length();

// Iterating through all substrings in
// way so that we can find first and last
// character easily
for (int i=0; i<n; i++)
for (int j=i+1; j<n; j++)
if (s[i] == s[j]) {
if(s[i] == 'A' || s[i] == 'T'){
result++;
for(int k=i;k<=j;k++){
cout << s[k];
}
cout << endl;
}

}
// result++;

return result;
}

// Driver function
int main()
{
string s;
cin >> s;
cout << "Total DFA matched strings::"<< countSubstringWithEqualEnds(s);
return 0;
}

***********************************************************************************************

OUTPUT:

이지cn イ

THANK YOU