To analyze which one is better I used the code given below:
Part 1 c
= [0 -1/pi 0 1/2 0 -1/pi 0];
= fftshift(fft(h, 256);
h1 = [0 -1/(4*pi) 0 1/2 0 -1/(4*pi)
CS 476 8. Reducibility
Denition Reduction: transforming one problem into another, such that the solution to the second problem
yields the solution to the rst one.
solve A(. . .)
solve B(. . .)
If B can be solved, then A can
29 9 2014
#define MAXCHR 500
#define DIV 23
/* DIV = NUMBER_OF_STATES */
int main(int argc, char *argv)cfw_
CS 476 7. Decidability/Undecidability
Languages that are always accepted or rejected by a Turing Machine (i.e. by a decider TM).
Denition We will use < M > to denote the binary encoding of a TM. Or, alternatively, write a program
CS 476 3. Regular Expressions
An alternative way to describe regular languages
Common in scripting languages (perl, python, etc.) & UNIX utilities (awk, sed, grep, etc.)
Dened by the regular operations:
Union ( or +)
CS 476 2. Non-deterministic nite automata
Non-deterministic Finite Automata
For a given state and input, transition function can have more than one results, or no result at all.
(q0 , 0) = cfw_q1 , q2
CS 476 5. Pushdown Automata
A pushdown automata (PDA) is:
An NFA with a stack.
Stack: an innite LIFO memory.
Equivalent to CFGs.
Denition A PDA is a 6-tuple (Q, , , , q0 , F ) where
Q is the nite set of states.
is the input alphab
CS 476 4. Context-Free Grammars
A formal grammar is considered context free when its production rules can be applied regardless of the
context of a nonterminal. It does not matter which symbols the nonterminal is surrounded by, the
CS 476 Introduction
Automata, Computability, and Complexity
Central areas of theory of computation include Automata, Computability, and Complexity, which are linked
by the question:
What are the fundamental capabilities and limitations of computers?
1.b) The code to calculate the 16 point DFT of x[n] is given below:
% FIRST QUESTION
N = 16;
n = [0:1:(N-1)];
xn = sin(2*pi*4*n)/N);
Xn = fft(xn, N)
The result is shown below:
Columns 1 through 3
EEE-424 Digital Signal Processing
[Onur Yorulmaz's pigeon box]
1. Download the shirt.jpg and shirt_small.jpg images and load them into Matlab by using
the following function:
imagename = imread ( 'filename.jpg' );
Q2) The data for the last 30 observations of dolar vs. TL obtained from the Central Bank of
Turkish Republic can be seen below:
1. I found the size of the matrices as seen below:
small_shirt <400x380 uint8>,
The 400x380 and 800x760 part corresponds to the matrix (where the color of the
1. In this part we are wanted to analyze what number was dialed. I found the number
dialed as 1173 and it corresponds to the number of EE207 and the assistants Mehmet
Kseolu and Aya zelikkale.
CS 476 6. Turing Machines
Denition Turing Machine is a nite state machine with an innite and unrestricted memory (denoted as
Differences from nite automata:
A TM can both read and write on the tape.
The tape head can move both l