|
|
Demonstrations of Jumping Automata
Růžička, Ladislav ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike conventional finite automata that read input words continuously these automatas make a jump over some symbols and from there it can read a symbol. In this paper we will be mostly focused on finding a practical algorithm for solving the membership problem. As will be shown the membership problem for jumping finite automata can be reduced to finding a non-negative integral solution to a Quantifier-Free Presburger arithmetics formula. From such formula we are able to determine whole infinite language of jumping finite automata. We will show that some subset of jumping finite automata can be solved in polynomial time. We note that formula in Presburger arithmetics can be transformed to the corresponding concurent finite automata. Unfortunately for general jumping automata finding non-negative solution is not sufficent but it can reduce search space. Other heuristics will be presented that increase the effectivity for the general jumping finite automata acceptance process.
|
|
|
Security analysis of wireless Wi-Fi network
Passinger, Jiří ; Doležel, Radek (referee) ; Bartl, Milan (advisor)
This project is concerned with the security of Wi-Fi network. It defines security and introduces the principles of some security systems which are consequently instructed for its breakthrough, out of which follows the nature of security failures. The main emphasis is put on the current security issue of Wi-Fi Protected Setup (WPS) technology. Consequently, it is concerned with the putting into service of this technology in GNU/Linux distribution OpenWrt on Wi-Fi router TP-LINK TL-WR1043ND. The project is concluded with the suggestions for the correction of the security failure.
|
|
|
Demonstrations of Jumping Automata
Růžička, Ladislav ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike conventional finite automata that read input words continuously these automatas make a jump over some symbols and from there it can read a symbol. In this paper we will be mostly focused on finding a practical algorithm for solving the membership problem. As will be shown the membership problem for jumping finite automata can be reduced to finding a non-negative integral solution to a Quantifier-Free Presburger arithmetics formula. From such formula we are able to determine whole infinite language of jumping finite automata. We will show that some subset of jumping finite automata can be solved in polynomial time. We note that formula in Presburger arithmetics can be transformed to the corresponding concurent finite automata. Unfortunately for general jumping automata finding non-negative solution is not sufficent but it can reduce search space. Other heuristics will be presented that increase the effectivity for the general jumping finite automata acceptance process.
|
|
|
Security analysis of wireless Wi-Fi network
Passinger, Jiří ; Doležel, Radek (referee) ; Bartl, Milan (advisor)
This project is concerned with the security of Wi-Fi network. It defines security and introduces the principles of some security systems which are consequently instructed for its breakthrough, out of which follows the nature of security failures. The main emphasis is put on the current security issue of Wi-Fi Protected Setup (WPS) technology. Consequently, it is concerned with the putting into service of this technology in GNU/Linux distribution OpenWrt on Wi-Fi router TP-LINK TL-WR1043ND. The project is concluded with the suggestions for the correction of the security failure.
|
guest ::
