Question

Write a program in c++ to implement/simulate a finite automaton that accepts (only):Odd length binary numbers // 0000001, 101, 11111, etc. It must return accepted or rejected(HAVE TO SHOW EACH STATE AS A FUNCTION,Q0 AND Q1. CANNOT USE STRINGS OR LENGTH OF STRING) not the same posted problem

Answer 1

#include <iostream>

using namespace std;

int main()
{
int i = 0;
char c;
printf("Enter Input:");
while ((c = getchar()) != '\n')
{ // read a line char by char
if ( c!='0' && c!='1')
{
    printf("Invalid Input \n");
    return 0;
}

printf("The value at state q%u\n is %c\n",i, c);
i++;
}
if(i%2 != 0)
{
printf("The string is accepted");
   
}
else
{
printf("The string is Rejected");
}
return 0;
}