We will examine topics in weighted automata.
These include models such as:
- Probabilistic Automata
- Tropical (Min,+) Weighted Automata
- Rational Series
- Linear Dynamical Systems (maybe, especially if people like transcendental number theory)
The type of results we will be looking at are:
- Undecidability results in weighted automata
- Determinizability and determinization algorithms of weighted automata
- Equivalence algorithms and their complexity.
The seminar is heavily mathematically oriented, and while it is not assumed that you are familiar with algebraic structures, probability spaces, and theory of computation, it is assumed that you're mathematically capable of getting up to speed on some non-trivial aspects of mathematics and theoretical computer science.