-3

Example: 00,0011,0022102120, etc. is fine 00112,0221100, etc. is wrong

I have done similar thing with the alphabet {0,1} and strings that have equal number of 0 and 1.

Here I run into a problem where it seems that my automata just keeps "expanding"...

mIl3
  • 1
  • 1
  • 1
    @mll3 Hi! please add context and show attempt. –  Nov 20 '22 at 19:39
  • Can you solve the analogous binary problem? – lulu Nov 20 '22 at 20:04
  • @lulu Yes, I get 4 states and it's quit simple but here I can't do it. – mIl3 Nov 20 '22 at 20:14
  • 1
    So, edit your post to include the solution for the analogous binary problem. Not clear to me where you run into problems passing from two letters to three. – lulu Nov 20 '22 at 20:18
  • Hint: create eight states --- to +++ where ++- means you have an even number of zeroes, an even number of ones and an odd number of twos. – John Douma Nov 20 '22 at 20:32

1 Answers1

-1

Here is the solution. I feel so stupid for spending a day to do this. Thanks for help

mIl3
  • 1
  • 1
  • 1
    Edit your post to include your work. Providing a link, only, is grounds for deletion. – amWhy Nov 20 '22 at 20:53