Scribd
Upload
12 views1 page

Flat Assi

The document outlines the design of various Deterministic Finite Automata (DFA) for specific conditions on binary and alphabetic strings. It includes requirements such as counting characters, avoiding patterns, and ensuring specific character placements. Each task specifies the criteria for acceptance and may require a state transition diagram.

Uploaded by

Virat kohli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views1 page

Flat Assi

The document outlines the design of various Deterministic Finite Automata (DFA) for specific conditions on binary and alphabetic strings. It includes requirements such as counting characters, avoiding patterns, and ensuring specific character placements. Each task specifies the criteria for acceptance and may require a state transition diagram.

Uploaded by

Virat kohli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

1.

Design a DFA that accepts binary strings where the number of 0s


is divisible by 3 and the number of 1s is even. Provide the state
transition diagram.
2. Construct a DFA that accepts binary strings that do not contain
three consecutive 1s.
3. Design a DFA over {a, b} that accepts strings where every ‘a’ is
immediately followed by at least one ‘b’.
4. Create a DFA that accepts strings that start and end with different
characters over {0,1,2}.
5. Design a DFA that accepts binary strings where every occurrence of
"101" is followed by at least one "0".
6. Design a DFA that accepts strings over {a-z, A-Z} where the first and last
character are vowels (a, e, i, o, u, A, E, I, O, U).
7. Construct a DFA that accepts valid variable names in a programming language
where:

 The first character must be a letter (A-Z, a-z).


 The remaining characters can be letters (A-Z, a-z) or digits (0-9).
 The length of the string is at least 2.

You might also like