This thesis is a continuation of my bachelor thesis, which is dedicated to syntax analysis based on deep pushdown automata. In theorical part of this thesis is defined everything fundamental for this work, for example deep syntax-directed translation, pushdown automata, deep pushdown automata, finite transducer and deep pushdown transducer.   The second part of this thesis is dedicated to the educational program for students of IFJ. In this part is defined strucure of this program and its parts. All part of program are analyzed from a theoretical and practical point of view.

This dissertation deals with the developing and development of EFL learners' communicative competence in writing in a blended learning course. The dissertation addresses issues related to the conceptualization of developing communicative competence and measuring learners' progress as well as using ICT in foreign language teaching. The underlying research question was whether learners' communicative competence changed after using a series of online discussion tasks, and if so, in what manner. The empirical research was conducted as a case study in which 18 learners in an EFL course at the CEFR A2 level participated in three discussion tasks conducted online, using asynchronous discussion forum. The discussions were built on social constructivist learning theories. Methods of data collection and analysis included pre- and post-tests, learner corpus compiled from the texts written by the students in two online discussions and its analysis, and a questionnaire survey. The results showed that learners' overall level of communicative competence in writing improved. Specifically, the syntactic complexity of learners' language produced at the beginning and at the end of the course increased and learners' perceived fluency in writing improved. These findings support the claim that learners' active participation in...

The goal of this dissertation is to implement an application for ASP to ASPX conversion. The ASP pages should be written in the VBScript language, the target language for ASPX will be C#. The application is developed on the .NET platform. The conversion process should be automatic. There should be no need to alter the converted files by a programmer. The first part of this dissertation introduces the whole problematic. It shows also current solutions. The next part is the analysis and the design of the application itself. The main part of this dissertation is the VBScript grammar conversion, problems while conversion and its solving.

This diploma thesis examines translation counterparts of the English verbs be and have and the Czech verbs být and mít. It focuses on instances with a divergent translation counterpart, i.e. instances in which be corresponds to mít and have corresponds to být in the English-Czech direction, and instances of být being reflected as have and mít as be in the Czech - English direction. The aim of the paper is to determine to what extent divergent verb counterparts are used in the translation, whether the target language has available alternatives with a verb counterpart identical with the original, and what are the motivating factors that influence the choice of a divergent verb counterpart. Another objective is to examine the changes in the syntactic and semantic structure connected with the use of a divergent verb counterpart, and to assess their impact on the functional sentence perspective. The research used material from the parallel Intercorp. A total of 164 examples with a divergent verb counterpart was excerpted and the research was divided into four parts, according to the source language and the verb. The use of divergent verb counterparts was explained mostly by a lexical gap in the target language, or by semantic and stylistic factors and to a smaller extent also by the influence of the...

The main goal of this master thesis is introduction and investigation of extended version of jumping automata and grammars. New versions are primarily focused on bioinformatic applications - DNA computing. This thesis examine their power and other properties of new models and makes comparison with existing computer science models. Then thesis demontrates practical applications, specifically amino acid and protein detections inside DNA sequence and makes comparision with existing tools in DNA computing for example Mark´s probabilistic models.

This thesis introduces syntax-directed translation based on deep pushdown automata. Necessary theoretical models are introduced in the theoretical part. The most important model, introduced in this thesis, is a deep pushdown transducer. The transducer should be used in syntax analysis, significant part of translation. Practical part consists of an implementation of simple-language interpret based on these models.

This PhD thesis deals with the use of structural methods of objects identification for industrial robots operation. First, the present state of knowledge in the field is described, i.e. the whole process of objects recognition with the aid of common methods of the syntactic analysis. The main disadvantage of these methods is that is impossible to recognize objects whose digitalized image is corrupted in some ways (due to excessive noise or image disturbances), objects are therefore deformed. Further, other methods for the recognition of deformed objects are described. These methods use structural description of objects for object recognition, i.e. methods which determine the distance between attribute descriptions of images. The core part of this PhD thesis begins in Chapter 5, where deformation grammars, capable of description of all possible object deformations, are described. The only complication in the analysis is the ambiguity of the deformation grammar, which lowers the effectiveness of the analysis. Further, PhD thesis deals with the selection and modification of a proper parser, which is able to analyze a deformation grammar effectively. Three parsers are described: the modified Earley parser, the modified Tomita parser and the modified hybrid LRE(k) parser. As for the modified Earley’s parser, ways of its effective implementation are described. One of the necessary parts of the object recognition is providing the invariances, which this PhD thesis covers in detail, too. Finally, the results of described algorithms are mentioned (successfulness and speed of deformed objects recognition) and suggested testing environment and implemented algorithms are described. In conclusion, all determined possibilities of deformation grammars and their results are summarized.

This thesis investigates multi pushdown automata and introduces their   new modifications based on deep pushdown.  The first modification is Input driven multi deep pushdown automata, which has several deep pushdown lists and the current input symbol determines whether the automaton performs a push operation, a pop operation, an expansion operation or does not touch the stack. The second introduced modification is Regulated pushdown automata by deep pushdown. In addition to ordinary pushdowns, this version contains deep pushdown, which is used to generate the control language. This thesis proves, that the acceptance power of the described variants  is equal to the accepting power of Turing machines.  This thesis also contains view on program realisation of theoretical models, which were described in the theoretical part and introduces a library for the syntax analysis, which is based on it.

This document deals with introduction focused on pragmatically oriented research at branch of theoretical computer science and with presentation of designed methods for chosen application topics. At this study the theoretical subject is represented by kind of generative system - multisequential grammar and application topics are chosen according to possibilities supported by multisequential grammars. In order to follow results published by Thompson (see [9]), Lindenmayer (see [26]), Mandelbrot (see [8]) and also studies published by Morneau (see [17]), which shows the relation between natural laws and human discipline - mathematics, we study the applications of multi-sequential grammars from two points of view: generative L-systems (which further includes applications of fractal geometry and biomathematics) and natural language processing (which further includes the design of proper abstract language). Some problems related to compiler construction are also mentioned.

This thesis studies regulated grammars, their fundamentals and expressing power regarding Chomsky hierarchy of languages. Programmed grammars are investigated in more depth considering a few types of leftmost derivations. A variant of deterministic syntax analysis of programmed grammars is introduced. This analysis works similarly as LL(k) parsing. Transformations of matrix grammars into programmed grammars without changing their expressing power are introduced. The syntax analysis by regularly controlled grammars partly using programmed grammars are presented. In the end, cooperating distributed grammars with left permitting grammars as components are mentioned. Their deterministic syntax analysis uses predictive table or exhaustive exploration of the whole state space.