CODEWITHSUNDEEP
finite-automatadfajflap
user463216
user463216

Reputation: 1

Determinant Finite Automata (JFLAP)

I have a DFA question (Determinant Finite Automata) . We are using JFLAP to construct the automata. I cannot figure this question out to save my life! Here it is

"DFA to recognize the language of all strings that have an even number of zeros and an odd number of ones."

So the alphabet is {0,1} and only using 0,1. So I need to build an automata that recognizes an even number of zeros and an odd number of ones.

Upvotes: 0

Views: 5829

Answers (2)

ehsun7b
ehsun7b

Reputation: 4866

enter image description here

Upvotes: 3

Meng
Meng

Reputation: 11

I don't know whether my understanding is right. I could give you the description in Grail format that generate an even number of zeros and an odd number of ones.

START 1

1 1 2

2 1 1

1 0 3

3 0 4

4 0 3

FINAL 3

Upvotes: 0

Related Questions