Scribd
Upload
96 views1 page

L (Abnnm, M ) : Formal Language and Automata Theory Wcu Seng

This document contains 6 questions about finite automata: 1. Design DFAs for languages over {a,b} without substring "aaa" and over {0,1} for strings divisible by 3 as a binary number. 2. Construct DFAs for strings with exactly one 'a', at least one 'a', and no more than three 'a's, and strings with at least one 'a' and exactly two 'b's. 3. Construct an NFA for the language where strings are of the form "a b n n m" where m is greater than or equal to n. 4. For an NFA, determine the states visited and acceptance for input strings

Uploaded by

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

L (Abnnm, M ) : Formal Language and Automata Theory Wcu Seng

This document contains 6 questions about finite automata: 1. Design DFAs for languages over {a,b} without substring "aaa" and over {0,1} for strings divisible by 3 as a binary number. 2. Construct DFAs for strings with exactly one 'a', at least one 'a', and no more than three 'a's, and strings with at least one 'a' and exactly two 'b's. 3. Construct an NFA for the language where strings are of the form "a b n n m" where m is greater than or equal to n. 4. For an NFA, determine the states visited and acceptance for input strings

Uploaded by

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

Wachemo University

Collage of engineering and technology School of computing and informatics


Department of software engineering
Worksheet 1 on Finite Automata
1. Design a DFA that accepts the language consisting of the set of those strings over {a, b} that do
not contain the substring aaa.
2. Design a DFA that accepts the language consisting of the set of all strings over {0, 1} that are
divisible by 3 when interpreted as binary number.
3. construct DFA that accepts the following set of strings
(a) all strings with exactly one ‘a’
(b) all strings with at least one ‘a’
(c) all strings with no more than three a’s
(d) all strings with at least one ‘a’ and exactly two b’s.
4. construct NFA for a language defined by
L = {a b n n m , m ≥ }
5. Consider the following

a) For each of the following strings w, write the names of states visited in
the path and determine whether w is accepted or not.

i) aabbba ii) bab iii) ababba


b) Convert the NFA into equivalent DFA.
6. Minimize the DFA given by the following transition table and draw transition
diagram for the minimiz.

FORMAL LANGUAGE AND AUTOMATA THEORY WCU SENG

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy