#include <stdio.h>
#include <stdlib.h>

#define REJECT 0
#define ACCEPT 1
#define STOP 2

#define MAXSIZE 100

typedef struct {
   int p; /* input state */
   int a; /* input symbol */
   int q; /* output state */
} rule;

typedef struct {
   int n;           /* number of states */
   int m;           /* number of transition rules */
   int f[MAXSIZE];  /* final states */
   rule T[MAXSIZE]; /* transition table */
} FSM;

FSM readFSM ( )
{
   FSM M;
   int p, a, q, i;

   printf("Enter the number of states: "); scanf("%d", &(M.n));
   printf("The states will be numbered 0 to %d\n", M.n-1);
   for (p=0; p<M.n; ++p) M.f[p] = 0;
   printf("The start state is 0\n");
   printf("Enter the final states one by one (-1 to terminate)\n");
   while (1) {
      scanf("%d", &p);
      if ((p < 0) || (p >= M.n)) break;
      M.f[p] = 1;
   }
   printf("Enter the rules one by one\n");
   i = M.m = 0;
   for (p=0; p<M.n; ++p) {
      for (a=0; a<=1; ++a) {
         printf("p = %d, a = %d, q = ", p, a);
         scanf("%d", &q);
         M.T[i].p = p; M.T[i].a = a; M.T[i].q = q;
         ++i; ++M.m;
      }
   }
   return M;
}

int runFSM ( FSM M )
{
   int p, a, i;

   printf("Do you want to continue (0/1)? "); scanf("%d", &a);
   if (a == 0) return STOP;
   p = 0;
   printf("Enter input symbols one by one (-1 to terminate)\n");
   while (1) {
      scanf("%d", &a); if ((a < 0) || (a >= M.n)) break;
      for (i=0; i<M.m; ++i) if ((M.T[i].p == p) && (M.T[i].a == a)) break;
      p = M.T[i].q;
   }
   return (M.f[p]) ? ACCEPT : REJECT;
}

int main ( )
{
   FSM M;
   int decision;

   M = readFSM();
   while (1) {
      decision = runFSM(M);
      if (decision == ACCEPT) printf("+++ ACCEPT\n");
      else if (decision == REJECT) printf("+++ REJECT\n");
      else break;
   }

   exit(0);
}