Zobrazeno 1 - 10
of 16
pro vyhledávání: '"konečné automaty"'
Autor:
Kotoun, Michal
Mnoho aplikací přijímá, odesílá a zpracovává data v textové podobě. Správné a bezpečné zpracování těchto dat je typicky zajištěno tzv. ošetřením řetězců (string sanitization). Pomocí metod formální verifikace je možné an
Externí odkaz:
http://www.nusl.cz/ntk/nusl-433553
Autor:
Havlena, Vojtěch
Tato práce se zabývá vývojem efektivních technik pro konečné automaty a jejich aplikace. Zejména se věnujeme konečným automatům použitých pří detekci útoků v síťovém provozu a automatům v rozhodovacích procedurách a verifikaci
Externí odkaz:
http://www.nusl.cz/ntk/nusl-455835
Autor:
Hošták, Viliam Samuel
The focus of this thesis is the fast network anomaly detection based on automata learning. It describes and compares several chosen automata learning algorithms including their adaptation for the learning of network characteristics. In this work, var
Externí odkaz:
http://www.nusl.cz/ntk/nusl-449296
Autor:
Vorel, Vojtěch
Original results in computational and combinatorial theory of reset words in transition systems, road coloring in directed graphs, and discontinuous input processing in formal languages are presented, including strong lower bounds on subset synchroni
Externí odkaz:
http://www.nusl.cz/ntk/nusl-391347
Autor:
Říha, Jakub
Finite automata are an important mathematical abstraction, and in formal verification, they are used for a concise representation of regular languages. Operations often used on finite automata in this setting are testing their universality and langua
Externí odkaz:
http://www.nusl.cz/ntk/nusl-363879
Autor:
Havlena, Vojtěch
The focus of this thesis is the comparison of languages and the reduction of automata used in network traffic monitoring. In this work, several approaches for approximate (language non-preserving) reduction of automata and comparison of their languag
Externí odkaz:
http://www.nusl.cz/ntk/nusl-363849
Autor:
Černý, Jakub
This thesis formalizes a model of bounded rationality in extensive-form games called game-playing schemata. In this model, the strategies are repre- sented by a structure consisting of a deterministic finite automaton and two computational functions.
Externí odkaz:
http://www.nusl.cz/ntk/nusl-365076
Autor:
Renát, Dušan
In the present work we introduce and study the hierarchical finite state machines as a model of artificial intelligence of autonomous agents in various virtual environments and systems. We define the concept of hierarchical finite state machine forma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5750130af5086f65e90bc5dc8f712414
http://www.nusl.cz/ntk/nusl-301403
http://www.nusl.cz/ntk/nusl-301403
Autor:
Košař, Vlastimil
This term project focuses on algorithms for pattern matching used in modern IDS. The main focus is on regular expression matching. It deals with methods based on deterministic and nondeterministic finite automata, hybrid methods and with method based
Externí odkaz:
http://www.nusl.cz/ntk/nusl-237092