Title: Testing the Learning of Restarting Automata using Genetic Algorithm Author: Bc. Lenka Kovářová Department: Department of Software and Computer Science Education Supervisor: RNDr. František Mráz, CSc. Abstract: Restarting automaton is a theoretical model of device recognizing a formal language. The construction of various versions of restarting automata can be a hard work. Many different methods of learning such automata have been developed till now. Among them are also methods for learning target restarting automaton from a finite set of positive and negative samples using genetic algorithms. In this work, we propose a method for improving learning of restarting automata by means of evolutionary algorithms. The improvement consists i...
Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. I...
Autonomous vehicles require sophisticated software controllers to maintain vehicle performance in th...
AbstractIn this paper, we propose a new algorithm to induce an internal contextual grammar from posi...
Title: Testing the Learning of Restarting Automata using Genetic Algorithm Author: Bc. Lenka Kovářov...
Restarting automata are linguistically motivated models for language representation. The main goal o...
In the present work is discussed the problem of learning of analysis by reduction. Analysis by reduc...
S OBSMi Nazev praee: I'cenie restartovacich ;mtornafov gemitickymi algoritrnami Autor: Pel r Hoffman...
Restarting automata are linguistically motivated models of automata that can be used e.g. in checkin...
Presents a genetic algorithm used to infer pushdown automata from legal and illegal examples of a la...
Restarting automata were introduced as a model for analysis by reduction which is a linguistically m...
Both stochastic learning automata and genetic algorithms have previously been shown to have valuable...
The focus of this paper is towards developing a grammatical inference system uses a genetic algorith...
In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed....
Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hyp...
This bachelor’s thesis aims to examine possibilities of designing a transition function enabli...
Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. I...
Autonomous vehicles require sophisticated software controllers to maintain vehicle performance in th...
AbstractIn this paper, we propose a new algorithm to induce an internal contextual grammar from posi...
Title: Testing the Learning of Restarting Automata using Genetic Algorithm Author: Bc. Lenka Kovářov...
Restarting automata are linguistically motivated models for language representation. The main goal o...
In the present work is discussed the problem of learning of analysis by reduction. Analysis by reduc...
S OBSMi Nazev praee: I'cenie restartovacich ;mtornafov gemitickymi algoritrnami Autor: Pel r Hoffman...
Restarting automata are linguistically motivated models of automata that can be used e.g. in checkin...
Presents a genetic algorithm used to infer pushdown automata from legal and illegal examples of a la...
Restarting automata were introduced as a model for analysis by reduction which is a linguistically m...
Both stochastic learning automata and genetic algorithms have previously been shown to have valuable...
The focus of this paper is towards developing a grammatical inference system uses a genetic algorith...
In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed....
Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hyp...
This bachelor’s thesis aims to examine possibilities of designing a transition function enabli...
Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. I...
Autonomous vehicles require sophisticated software controllers to maintain vehicle performance in th...
AbstractIn this paper, we propose a new algorithm to induce an internal contextual grammar from posi...