
Formal Language Theory Applied to Computer Security
Regéciová, Dominika ; Kolář, Dušan (referee) ; Meduna, Alexandr (advisor)
Computer security is and will always be a critical area that affects everyone. Despite all the efforts made to build safer systems and test them, however, new vulnerabilities and vulnerabilities are still emerging and creating the impression of tilting at windmills. Partial justification of the current state, but also possible solutions, brings in many respects an extraordinary view of security through formal language theory. Emphasis should be put on a more responsible approach to the recognition and processing of inputs, which are often the gateway to many attacks. In this paper, we will get acquainted with this trend and its recommendations for development and will then introduce a new method of detecting SQL injection attacks built on its foundations.

 

Formal Language Theory Applied to Computer Security
Regéciová, Dominika ; Kolář, Dušan (referee) ; Meduna, Alexandr (advisor)
Computer security is and will always be a critical area that affects everyone. Despite all the efforts made to build safer systems and test them, however, new vulnerabilities and vulnerabilities are still emerging and creating the impression of tilting at windmills. Partial justification of the current state, but also possible solutions, brings in many respects an extraordinary view of security through formal language theory. Emphasis should be put on a more responsible approach to the recognition and processing of inputs, which are often the gateway to many attacks. In this paper, we will get acquainted with this trend and its recommendations for development and will then introduce a new method of detecting SQL injection attacks built on its foundations.


The Computational Power of Neural Networks and Representations of Numbers in NonInteger Bases.
Šíma, Jiří
We briefly survey the basic concepts and results concerning the computational power of neural networks which basically depends on the information content of weight parameters. In particular, recurrent neural networks with integer, rational, and arbitrary real weights are classified within the Chomsky and finer complexity hierarchies. Then we refine the analysis between integer and rational weights by investigating an intermediate model of integerweight neural networks with an extra analog rationalweight neuron (1ANN). We show a representation theorem which characterizes the classification problems solvable by 1ANNs, by using socalled cut languages. Our analysis reveals an interesting link to an active research field on nonstandard positional numeral systems with noninteger bases. Within this framework, we introduce a new concept of quasiperiodic numbers which is used to classify the computational power of 1ANNs within the Chomsky hierarchy.


The Computational Power of Neural Networks and Representations of Numbers in NonInteger Bases
Šíma, Jiří
We briefly survey the basic concepts and results concerning the computational power of neural networks which basically depends on the information content of weight parameters. In particular, recurrent neural networks with integer, rational, and arbitrary real weights are classified within the Chomsky and finer complexity hierarchies. Then we refine the analysis between integer and rational weights by investigating an intermediate model of integerweight neural networks with an extra analog rationalweight neuron (1ANN). We show a representation theorem which characterizes the classification problems solvable by 1ANNs, by using socalled cut languages. Our analysis reveals an interesting link to an active research field on nonstandard positional numeral systems with noninteger bases. Within this framework, we introduce a new concept of quasiperiodic numbers which is used to classify the computational power of 1ANNs within the Chomsky hierarchy.


The Computational Power of Neural Networks and Representations of Numbers in NonInteger Bases
Šíma, Jiří
We briefly survey the basic concepts and results concerning the computational power of neural networks which basically depends on the information content of weight parameters. In particular, recurrent neural networks with integer, rational, and arbitrary real weights are classified within the Chomsky and finer complexity hierarchies. Then we refine the analysis between integer and rational weights by investigating an intermediate model of integerweight neural networks with an extra analog rationalweight neuron (1ANN). We show a representation theorem which characterizes the classification problems solvable by 1ANNs, by using socalled cut languages. Our analysis reveals an interesting link to an active research field on nonstandard positional numeral systems with noninteger bases. Within this framework, we introduce a new concept of quasiperiodic numbers which is used to classify the computational power of 1ANNs within the Chomsky hierarchy.

 