Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules. The alphabet of a formal language consists of symbols, letters, or tokens that concatenate into strings of the language. Each string concatenated from symbols of this alphabet is called a word, and the words that belong to a particular formal language are sometimes called well-formed words or well-formed formulas. A formal language is often defined by means of a formal grammar such as a regular grammar or context-free grammar, which consists of its formation rules. In computer science, formal languages are used among others as the basis for defining the grammar of programming languages and formalized versions of subsets of natural languages in which the words of the language represent concepts that are associated with meanings or semantics. In computational complexity theory, decision problems are typically defined as formal languages, and complexity classes are defined as the sets of the formal languages that can be parsed by machines with limited computational power. In logic and the foundations of mathematics, formal languages are used to represent the syntax of axiomatic systems, and mathematical formalism is the philosophy that all of mathematics can be reduced to the syntactic manipulation of formal languages in this way. The field of formal language theory studies primarily the purely syntactical aspects of such languages—that is, their internal structural patterns. Formal language theory sprang out of linguistics, as a way of understanding the syntactic regularities of natural languages. In the 17th century, Gottfried Leibniz imagined and described the characteristica universalis, a universal and formal language which utilised pictographs. During this period, Carl Friedrich Gauss also investigated the problem of Gauss codes.
[2]Paolo Prandoni, [3]LCAV, EPFL
In this notebook we will investigate the effect of phase on the
perceptual quality of a sound. It is often said that the human ear is
commercial-grade audio equipment takes place in the magnitude domain
only.
In [1]:
%matplotlib inline
import matplotlib
import matplotlib.pyplot as plt
import numpy as np
import IPython
from scipy.io import wavfile
In [2]:
plt.rcParams["figure.fig "I defy anybody to find a record... unless it is some old blues
record from 1922... that uses feedback that way. So I claim it for
the Beatles. Before H
[2]Paolo Prandoni, [3]LCAV, EPFL
This simple notebook lets you interactively explore the intermodulation
effects of two superimposed sinusoids.
In [1]:
[2]Paolo Prandoni, [3]LCAV, EPFL
In this notebook we will look at the practical issues associated to
plotting the DFT and in particular the DFT of real-world signals. We
will examine how to map the DFT coefficients to real-world frequencies
and we will investigate the frequency resolution of the DFT and the
effects of zero padding.
In [1]: