|
|
Machine learning of formal languages
Klonfar, Matěj ; Mráz, František (advisor) ; Bednárek, David (referee)
In the present work I study the task of machine learning of formal languages. The task of the work is to design and implement the program with anyone will be able to study the progress and results of algorithms for learning languages. With this program is possible to run algorithms for learning from examples. Examples could be sets of positive and negative examples of the result languages or sets expressed by teacher who knows the result language. The main task is to design easily extensible application with a view to inserting add-ins without no limits of used representation of learned languages or language complexity.
|
|
|
Machine learning of formal languages
Klonfar, Matěj ; Mráz, František (advisor) ; Plátek, Martin (referee)
In the present work I study the task of machine learning of formal languages. The task of the work is to design and implement the program with anyone will be able to study the progress and results of algorithms for learning languages. With this program is possible to run algorithms for learning from examples. Examples could be sets of positive and negative examples of the result languages or sets expressed by teacher who knows the result language. The main task is to design easily extensible application with a view to inserting add-ins without no limits of used representation of learned languages or language complexity.
|
|
|
Machine learning of formal languages
Klonfar, Matěj ; Mráz, František (advisor) ; Plátek, Martin (referee)
In the present work I study the task of machine learning of formal languages. The task of the work is to design and implement the program with anyone will be able to study the progress and results of algorithms for learning languages. With this program is possible to run algorithms for learning from examples. Examples could be sets of positive and negative examples of the result languages or sets expressed by teacher who knows the result language. The main task is to design easily extensible application with a view to inserting add-ins without no limits of used representation of learned languages or language complexity.
|
|
|
Machine learning of formal languages
Klonfar, Matěj ; Mráz, František (advisor) ; Plátek, Martin (referee)
In the present work I study the task of machine learning of formal languages. The task of the work is to design and implement the program with anyone will be able to study the progress and results of algorithms for learning languages. With this program is possible to run algorithms for learning from examples. Examples could be sets of positive and negative examples of the result languages or sets expressed by teacher who knows the result language. The main task is to design easily extensible application with a view to inserting add-ins without no limits of used representation of learned languages or language complexity.
|
|
|
Machine learning of formal languages
Klonfar, Matěj ; Mráz, František (advisor) ; Plátek, Martin (referee)
In the present work I study the task of machine learning of formal languages. The task of the work is to design and implement the program with anyone will be able to study the progress and results of algorithms for learning languages. With this program is possible to run algorithms for learning from examples. Examples could be sets of positive and negative examples of the result languages or sets expressed by teacher who knows the result language. The main task is to design easily extensible application with a view to inserting add-ins without no limits of used representation of learned languages or language complexity.
|
|
|
Machine learning of formal languages
Klonfar, Matěj ; Bednárek, David (referee) ; Mráz, František (advisor)
In the present work I study the task of machine learning of formal languages. The task of the work is to design and implement the program with anyone will be able to study the progress and results of algorithms for learning languages. With this program is possible to run algorithms for learning from examples. Examples could be sets of positive and negative examples of the result languages or sets expressed by teacher who knows the result language. The main task is to design easily extensible application with a view to inserting add-ins without no limits of used representation of learned languages or language complexity.
|
guest ::
