Scribd
Upload
14 views2 pages

Sheet 1

The document outlines exercises for a course on Automata and Computability at Ain Shams University. It includes tasks such as creating deterministic finite automata (DFAs) for various sets and characteristics, as well as building transition tables. The exercises focus on understanding the behavior of DFAs with specific input conditions and acceptance criteria.

Uploaded by

Bebo BX
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
14 views2 pages

Sheet 1

The document outlines exercises for a course on Automata and Computability at Ain Shams University. It includes tasks such as creating deterministic finite automata (DFAs) for various sets and characteristics, as well as building transition tables. The exercises focus on understanding the behavior of DFAs with specific input conditions and acceptance criteria.

Uploaded by

Bebo BX
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/ 2

Ain Shams University

Faculty of Engineering
Computer Engineering and Software Systems Program

CSE432: Automata and Computability – Summer 2024

Sheet 1
1. Let ∑ = {0,1}. Give DFAs for {}, {ϵ}, ∑* , ∑+

2. Assume we have the following sets:

What is the corresponding automaton?

3. Build the transition table for:


4. We want to build a deterministic finite automaton DFA with the following
characteristics:

• This DFA stays in the same state when the next input symbol is a 0.
This applies for all states (q0, q1, q2).
• In state q0, an input of 1 moves the DFA to state q1. In state q1, an
input of 1 moves the DFA to state q2.
• In state q2, an input of 1 moves the DFA back to state q0. If the DFA
is in state q1 when the input is finished, the DFA accepts the input
string.
• This DFA accepts the following words:
• ω = 00010000
• ω = 00010011001
• ω=1
• It rejects the following words:
• ω = 1100001
• ω = 0110000

5. construct DFAs for


I. {w| w has an odd number of a’s and ends with a b}
II. {w| w has even length and an odd number of a’s}
III. {w| w is any string not in (ab+)*}
IV. { w| w begins with a 1 and ends with a 0}
V. { w| w has length at least 3 and its third symbol is a 0}
VI. { w| w every odd position of w is a 1}

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