We will follow a similar approach to previous exercises to solve this exercise. Let’s define 4 states as follows: S0, the initial state S1 is the state when the automata read a 0 S2 is the state when the automata read a sequence of two 0s S3 is the state when the automata read a […]
We will follow a similar approach to previous exercises to solve this exercise. Let’s define 4 states as follows: S0, the initial state S1 is the state when the automata read a 1 S2 is the state when the automata read a 0 after a 1 S3 is the state when the automata read a
This exercise is a bit more difficult than the previous one. To solve this exercise, let’s use the following strategy: define states in which the automaton can be if it just reads a 1 or a 0. – We can have a state S1 which means the automaton read 0s. Therefore, from the state S0
To solve this exercise, we have to options. We can answer using a state table or state diagram. First, we need to consider that to be in the final state, we need first to start from S0, and recognize a 0, and then a 1. This tells us that we should have at least three
When using a weakly typed programming language, sometimes is useful to check if the type of the input is the type that we are expecting. This will avoid unpredictable problems with our program. So, how can we know if the user input is an integer? We use exception handling. Python and variable types Python is
How to check if a user input is an integer in Python? Read More »
Printing patterns is a great way to practice and get a better understanding of loops in any programming language. In this post, I’ll show how to print some of these patterns. General steps to print patterns in any programming language using loops With disregard of the pattern you want to print, there are general steps
Printing patterns in python Read More »
“Rules of inferences” is an important topic in Discrete Mathematics. We can use a rule (s) of inferences to prove if an argument is valid or not. We can also use rules of inference to produce valid arguments. In mathematics, an argument is a sequence of statements. We have a valid argument if and only
What rule of inference is used in each of these arguments? Read More »
The solution to this exercise is straightforward by constructing the truth table. By looking at the truth table for the two compound propositions p → q and ¬q → ¬p, we can conclude that they are logically equivalent because they have the same truth values (check the columns corresponding to the two compound propositions) Related
Show that p → q and ¬q → ¬p are logically equivalent Read More »
At a certain stage of your university degree, you must write a research proposal. Once approved, you have to do the research, solve a problem, and present the results. In this post, I’ll show the elements you should add to your proposal, as well as the order of those elements. Let’s get into it. The
How to write your research proposal? Read More »
A classic exercise in Discrete Mathematics is to negate a given proposition. Here, I’ll explain two things to consider after seeing how many students have problems solving this type of exercise. Background A proposition is a sentence that states a fact. It is True or False but not both. An example of a proposition is
Negating propositions Read More »
