Zpět na vyhledávání

Bc. Martin Frian

Bachelor's thesis

Simple models of quantum finite automata

Simple models of quantum finite automata
Abstract:
Cieľom tejto práce je jednotnou cestou prezentovať známe modely klasických a kvantových konečných automatov. V našej práci detailne prezentujeme päť významných modelov kvantových konečných automatov, takisto ako ich vlastnosti, výpočtovú silu, korešpondujúce rozhodovacie problémy, a taktiež vzťahy medzi rôznymi modelmi. V práci ďalej stručne prezentujeme tri ďaľšie modely kvantových konečných automatov …more
Abstract:
We present in a uniform way several models of classical finite automata and quantum finite automata. We have studied five main models of quantum finite automata in detail. Three other models of quantum finite automata were also briefly presented. We have also presented basic results concerning the power of each model, closure properties, mutual relations, and results concerning decision problems.
 

Keywords

finite automata quantum finite automata classical state quantum state regular languages acceptance probability quantum information processing quantum mechanics
 
Language used: English
Date on which the thesis was submitted / produced: 24. 5. 2018
Identifier: https://is.muni.cz/th/dy49n/

Thesis defence

  • Date of defence: 29. 6. 2018
  • Supervisor: prof. RNDr. Jozef Gruska, DrSc.
  • Reader: RNDr. Matej Pivoluska, Ph.D.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Bachelor programme / field:
Informatics / Mathematical Informatics

Theses on a related topic

List of theses with an identical keyword.