Original title: Efektivní algoritmy pro práci s čítacími automaty
Translated title: Efficient Algorithms for Counting Automata
Authors: Mikšaník, David ; Holík, Lukáš (referee) ; Lengál, Ondřej (advisor)
Document type: Bachelor's theses
Year: 2020
Language: eng
Publisher: Vysoké učení technické v Brně. Fakulta informačních technologií
Abstract: [eng] [cze]

Keywords: inkluze; konečné automaty; problém prázdnosti; regulární výrazy; čítací automaty; counting automata; emptiness problem; finite automata; inclusion; regular expressions

Institution: Brno University of Technology (web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library.
Original record: http://hdl.handle.net/11012/191521

Permalink: http://www.nusl.cz/ntk/nusl-416313


The record appears in these collections:
Universities and colleges > Public universities > Brno University of Technology
Academic theses (ETDs) > Bachelor's theses
 Record created 2020-08-02, last modified 2022-09-04


No fulltext
  • Export as DC, NUŠL, RIS
  • Share