Wystąpienie gościnne. Abuzer Yakaryilmaz, University of Latvia (https://abu.lu.lv) Abstract: In this talk, we start with the definition of probabilistic version of finite automata (PFAs). Then, we introduce quantum finite automata (QFAs) based on PFAs. After that, we present a few simple QFA algorithms as the evidences of quantum advantages References: A. C. Cem Say, Abuzer Yakaryilmaz: Quantum Finite Automata: A Modern Introduction. Computing with New Resources 2014: 208-222, https://arxiv.org/abs/1406.4048 Andris Ambainis, Abuzer Yakaryilmaz: Automata and quantum computing. Handbook of Automata Theory (II.) 2021: 1457-1493, https://arxiv.org/abs/1507.01988