|
|
Parsing Based on Automata with Deep Pushdowns
Pločicová, Dominika ; Dvořák, Tomáš (oponent) ; Meduna, Alexandr (vedoucí práce)
Language is a basic means of communication. Formal languages provide the basis for human-computer communication. The aim of this work is to contribute to this area and analyze the possibility of processing the context-sensitive elements of formal languages. The work includes the theoretical description of state grammar and deep pushdown automaton, which is a model of a parser for languages including context-sensitive elements. It describes an algorithm that can convert the state grammar to the said deep pushdown automaton. The work further describes parsing, its methods and the use of the created automaton in performing the syntax analysis. For a better understanding, the work also includes examples of the creation and operation of the automaton. Finally, the work describes the implementation of a program that performs theoretically described activities. The functionality of the program was verified on examples, whose inputs and outputs are also part of the text of the work.
|
|
|
Using NetFlow Data to Create Filtering Rules
Pločicová, Dominika ; Nagy, Peter (oponent) ; Grégr, Matěj (vedoucí práce)
The goal of this work is to design a system that will be able to detect an ongoing DDoS attack and create filtering rules to stop it. Upon getting the input definition of chosen traffic profiles from the network administrator, it should examine the ongoing traffic. In the case of an eventual DDoS attack from one or more defined profiles, it shall create a filtering rule to eliminate traffic belonging under the said profile (or profiles, respectively).
|
|
|
Parsing Based on Automata with Deep Pushdowns
Pločicová, Dominika ; Dvořák, Tomáš (oponent) ; Meduna, Alexandr (vedoucí práce)
Language is a basic means of communication. Formal languages provide the basis for human-computer communication. The aim of this work is to contribute to this area and analyze the possibility of processing the context-sensitive elements of formal languages. The work includes the theoretical description of state grammar and deep pushdown automaton, which is a model of a parser for languages including context-sensitive elements. It describes an algorithm that can convert the state grammar to the said deep pushdown automaton. The work further describes parsing, its methods and the use of the created automaton in performing the syntax analysis. For a better understanding, the work also includes examples of the creation and operation of the automaton. Finally, the work describes the implementation of a program that performs theoretically described activities. The functionality of the program was verified on examples, whose inputs and outputs are also part of the text of the work.
|
host ::
RSS.