Scribd
Upload
388 views9 pages

NFA Practice Question

The document outlines the design of various Non-deterministic Finite Automata (NFA) for different conditions on strings over the alphabet {a, b}. It includes specifications for strings that start and end with the same symbol, start and end with different symbols, contain specific substrings, and end or start with designated substrings. Additionally, it mentions a condition for the third character from the right end of accepted strings.

Uploaded by

Jayashree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
388 views9 pages

NFA Practice Question

The document outlines the design of various Non-deterministic Finite Automata (NFA) for different conditions on strings over the alphabet {a, b}. It includes specifications for strings that start and end with the same symbol, start and end with different symbols, contain specific substrings, and end or start with designated substrings. Additionally, it mentions a condition for the third character from the right end of accepted strings.

Uploaded by

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

Q1.

Design a NFA that accepts all strings over the alphabet


∑ = {a, b} such that every accepted string start and end
with same symbol
Q1. Design a NFA that accepts all strings over the alphabet
∑ = {a, b} such that every accepted string start and end
with same symbol
Q2. Design a NFA that accepts all strings over the alphabet
∑ = {a, b} such that every accepted string start and end
with different symbol
Q2. Design a NFA that accepts all strings over the alphabet
∑ = {a, b} such that every accepted string start and end
with different symbol
Q3. Design a minimal NFA that accepts all strings over the
alphabet ∑ = {a, b}. where every accepted string ‘w’
contains substring s, Where s = ’aba
Q4. Design a NFA that accepts all strings over the alphabet
∑ = {a, b}. where every accepted string ‘w’ ends with
substring ‘s’, Where s = ‘bab’?
Q5. Design a NFA that accepts all strings over the alphabet
∑ = {a, b}, where every accepted string ‘w’ starts with
substring s, Where s = ‘aba
Q6. Design a NDFA that accepts all strings over the
alphabet ∑ = {a, b} such that for every accepted string 3rd
from right end is always a ?
DFA Vs NFA

You might also like