|
|
Native Application for Mobile Devices
Beníčková, Zuzana ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
The diploma thesis deals with the universal mobile client-server application of Android and iOS devices solved in the native environment of the given operating systems. The work explores approaches to solving the problem in both environments. The application solution will display, store and process a variety of data sent to the server in a unified form as well as customize the look given the conditions addressed conditions and equipment. The aim of the thesis is to show and compare the native potential of the mobile device as well as to design a unified application of frequently asked issues - to view and access a large amount of stored data to the user.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
|
|
Alternative Transformations of Language Models
Havel, Martin ; Beníčková, Zuzana (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of regular expressions, finite automatas and transformation from regular expression to finite automata. The thesis proposes new transformation focused on minimal count of states and rules of finite automatas. Concept of alternative transformation is processed into algorithms and proved by mathematical proofs. The aim of thesis is to introduce approaches to transformation with new ones in the field of regular expressions and finite automatas. Great attention is dedicated to economic perspective of final finite automata. There were created algorithms, which are capable of transformation regular expression to finite automata. This work also provides a simple recipe for implementation of these structures. We introduced generic concept of transformation, that allows to create less complicated finite automatas. Using presented techniques it is possible to expand known transformation with new ones.
|
|
|
Native Application for Mobile Devices
Beníčková, Zuzana ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
The diploma thesis deals with the universal mobile client-server application of Android and iOS devices solved in the native environment of the given operating systems. The work explores approaches to solving the problem in both environments. The application solution will display, store and process a variety of data sent to the server in a unified form as well as customize the look given the conditions addressed conditions and equipment. The aim of the thesis is to show and compare the native potential of the mobile device as well as to design a unified application of frequently asked issues - to view and access a large amount of stored data to the user.
|
guest ::
