Logo Institute of Electrical Power and Energy Technology
Institute of Electrical Power and Energy Technology
Logo Institute of Electrical Power and Energy Technology
Institute of Electrical Power and Energy Technology
DE
EN
Search
DE
EN
Search
IEET > Staff > Research Assistants > Mirco Fabian Woidelko, M.Sc., M. A.

Mirco Fabian Woidelko

M.Sc., M.A.
Research Assistant

Contact

Mirco Woidelko, M.Sc., M.A.
E-6 Elektrische Energietechnik
  • Elektrische Energietechnik
Office Hours
nach Vereinbarung
Harburger Schloßstraße 36,
21079 Hamburg
Building HS36, Room C2 1.013
Phone: +49 40 42878 4093
Logo

Research Project

DisrupSys
Disruptive functions and technology for angle-based integrated grid operation in converter-dominated power systems with predominantly renewable energy supply

DisrupSys

Disruptive functions and technology for angle-based integrated grid operation in converter-dominated power systems with predominantly renewable energy supply

Federal Ministry for Economic Affairs and Climate Action (BMWK); Duration: 2021 to 2024

to the project page

Publications

TUHH Open Research (TORE)

Courses

Stud.IP
link to course in Stud.IP Studip_icon
Automata Theory and Formal Languages (VL)
Subtitle:
This course is part of the module: Automata Theory and Formal Languages
Semester:
SoSe 24
Course type:
Lecture
Course number:
lv332_s24
Lecturer:
Prof. Dr. Matthias Mnich, M. Sc., Dr. Ebrahim Ghorbani
Description:
  1. Propositional logic, Boolean algebra, propositional resolution, SAT-2KNF
  2. Predicate logic, unification, predicate logic resolution
  3. Temporal Logics (LTL, CTL)
  4. Deterministic finite automata, definition and construction
  5. Regular languages, closure properties, word problem, string matching
  6. Nondeterministic automata: 
    Rabin-Scott transformation of nondeterministic into deterministic automata
  7. Epsilon automata, minimization of automata,
    elimination of e-edges, uniqueness of the minimal automaton (modulo renaming of states)
  8. Myhill-Nerode Theorem: 
    Correctness of the minimization procedure, equivalence classes of strings induced by automata
  9. Pumping Lemma for regular languages:
    provision of a tool which, in some cases, can be used to show that a finite automaton principally cannot be expressive enough to solve a word problem for some given language
  10. Regular expressions vs. finite automata:
    Equivalence of formalisms, systematic transformation of representations, reductions
  11. Pushdown automata and context-free grammars:
    Definition of pushdown automata, definition of context-free grammars, derivations, parse trees, ambiguities, pumping lemma for context-free grammars, transformation of formalisms (from pushdown automata to context-free grammars and back)
  12. Chomsky normal form
  13. CYK algorithm for deciding the word problem for context-free grammrs
  14. Deterministic pushdown automata
  15. Deterministic vs. nondeterministic pushdown automata:
    Application for parsing, LL(k) or LR(k) grammars and parsers vs. deterministic pushdown automata, compiler compiler
  16. Regular grammars
  17. Outlook: Turing machines and linear bounded automata vs general and context-sensitive grammars
  18. Chomsky hierarchy
  19. Mealy- and Moore automata:
    Automata with output (w/o accepting states), infinite state sequences, automata networks
  20. Omega automata: Automata for infinite input words, Büchi automata, representation of state transition systems, verification w.r.t. temporal logic specifications (in particular LTL)
  21. LTL safety conditions and model checking with Büchi automata, relationships between automata and logic
  22. Fixed points, propositional mu-calculus
  23. Characterization of regular languages by monadic second-order logic (MSO)
Performance accreditation:
336 - Automata Theory and Formal Languages<ul><li>336 - Automata Theory and Formal Languages: Klausur schriftlich</li></ul><br>m624-2023 - Automata Theory and Formal Languages<ul><li>336 - Automata Theory and Formal Languages: Klausur schriftlich</li><li>vl432-2023 - Voluntary Course Work Automata Theory and Formal Languages - Exercises: Excercises</li></ul>
ECTS credit points:
4
Stud.IP informationen about this course:
Home institute: Institut für Algorithmen und Komplexität (E-11)
Registered participants in Stud.IP: 397
Postings: 25
Documents: 13

Supervised Theses

ongoing
completed

2023

  • Babendererde, A. (2023). Regelung eines Umrichters zum Anschluss eines Wasserstoffspeicherkraftwerks an die Höchstspannungsebene.

2022

  • Lim, I. (2022). Modelling and Integration of a Hydrogen Storage Power Plant in the 10-Machine New-England Power System.

  • Lindner, J. (2022). Primärregelungskonzepte für einen Batteriepufferspeicher eines Wasserstoffspeicherkraftwerkes.

  • Rieckborn, N. (2022). Modellierung des Umwandlungsprozesses eines Wasserstoffspeicherkraftwerks.

TU Hamburg
Institute of Electrical Power and Energy Technology (ieet) E-6
Prof. Dr.-Ing. Christian Becker
Harburger Schloßstraße 36
21079 Hamburg
E-mail : ieet(at)tuhh.de
Phone : +49 40 42878 3213
Fax : +49 40 42878 2382
Links
Map and Directions
Data Privacy
Imprint