facebook
favorite button
super instructor icon
Betrouwbare leraar
Deze leraar antwoordt snel. Dit getuigt van een goede dienstverlening naar haar of zijn leerlingen toe.
member since icon
Sinds december 2019
Leraar sinds december 2019
Cours particuliers en automation pour Siemens sur Tia Portal
course price icon
Van 31.77 $ /h
arrow icon
Je propose des cours de soutien en automation pour niveaux débutant et intermédiaire.
En fonction des besoins de l'élève, j'explique les fondamentaux de l'automation en m'assurant que l'élève aie bien compris les bases qui permettent de programmer l'automate.
Après les explications, je m'assure également de la maîtrise du programme avec des exemples et exercices pratiques.
Locatie
location type icon
Online vanuit la Belgique
Leeftijd
Tieners (13-17 jaar oud)
Volwassenen (18-64 jaar oud)
Senioren (65+ jaar oud)
Niveau van de leerling
Beginner
Gemiddeld
Duur
60 minuten
90 minuten
120 minuten
De les wordt gegeven in
Frans
Vaardigheden
Beoordelingen
Beschikbaarheid typische week
(GMT -05:00)
New York
at teacher icon
Online via webcam
Mon
Tue
Wed
Thu
Fri
Sat
Sun
00-04
04-08
08-12
12-16
16-20
20-24
Je propose des cours de soutien en math, physique et chimie du
niveau secondaire.
A partir du cours de l'élève, j'explique en profondeur les concepts et règles de chaque matière en m'assurant que l'élève aie bien compris les bases qui permettent de travailler le cours en question. Après les explications, je m'assure également de la bonne compréhension du coeur de la matière enseignée.
Lees meer
Vergelijkbare lessen
arrow icon previousarrow icon next
verified badge
Experienced and patient teacher of logic for computer science.

I have taught logic, formal languages and automata theory to undergraduates for six years. My tutoring is adapted to the student's level and goals. Whether you need to learn logic for your studies, or you would simply like to know more about the subject, I will be more than happy to help you improve your understanding and skills.

Logic
The sciences presuppose a certain standard of rationality. An ability to distinguish between correct reasoning and claims that do not follow from the assumptions. In this class we study the basic principles of logic and apply mathematical techniques to the study thereof.
Topics include:
Propositional and Predicate Logic
Syntax and semantics
Semantic Tableaux
Natural deduction
Correctness and soundness
Completeness

Formal languages and automata
A formal language is an abstraction of general characteristics of programming languages. Such a languages consists of a set of symbols together with some rules to determine whether a string made up out of those symbols is a member of the language.

Topics include:
Regular languages, context-free languages
Finite automata, pushdown automata, Turing machines
Regular expressions
Regular grammar, context-sensitive grammar
Pumping lemmas for regular and context-free languages
message icon
Contacteer Youssef
repeat students icon
1e les wordt ondersteund
door onze
Good-fit Leraar Garantie
Vergelijkbare lessen
arrow icon previousarrow icon next
verified badge
Experienced and patient teacher of logic for computer science.

I have taught logic, formal languages and automata theory to undergraduates for six years. My tutoring is adapted to the student's level and goals. Whether you need to learn logic for your studies, or you would simply like to know more about the subject, I will be more than happy to help you improve your understanding and skills.

Logic
The sciences presuppose a certain standard of rationality. An ability to distinguish between correct reasoning and claims that do not follow from the assumptions. In this class we study the basic principles of logic and apply mathematical techniques to the study thereof.
Topics include:
Propositional and Predicate Logic
Syntax and semantics
Semantic Tableaux
Natural deduction
Correctness and soundness
Completeness

Formal languages and automata
A formal language is an abstraction of general characteristics of programming languages. Such a languages consists of a set of symbols together with some rules to determine whether a string made up out of those symbols is a member of the language.

Topics include:
Regular languages, context-free languages
Finite automata, pushdown automata, Turing machines
Regular expressions
Regular grammar, context-sensitive grammar
Pumping lemmas for regular and context-free languages
Good-fit Leraar Garantie
favorite button
message icon
Contacteer Youssef