XML documents and related technologies represent one of the most widespread ways how data on the Web are maintained and interchanged. Unfortunately, many of the real-world documents contain various types of consistency issues that prevent their successful automated processing. In this thesis we focus on the problem of the structural invalidity and its correction. In particular, having one potentially invalid XML document modeled as a tree, and a schema in DTD or XML Schema languages modeled as a regular tree grammar, our goal is to find all the minimal corrections of this tree. The model we proposed builds on top of the recursively nested structures of correction multigraphs, where the shortest paths are being found. For this purpose we formally introduce three correction strategies with different pruning optimizations applied. According to the experiments we performed, the refinement correction strategy not only significantly outperforms all the other existing approaches, but also guarantees important characteristics the others cannot. Powered by TCPDF (www.tcpdf.org)

This thesis deals with the design and implementation of tools for creating a computer network simulation model. Network analysis is based on configuration files from connected network devices. According to the requirements of the simulation it is necessary in the configuration file to focus on data relating to the monitored elements and their properties, or which may be of some influence. The output is then passed on simulation environment to form the desired network model by the observed data, which is already possible to perform simulations.

The purpose of this thesis is to show a method, that would transform given Turing machine into propagating scattered context grammar, which language contains all valid computational histories of that particular Turing machine. Afterwards this thesis deals with questions arising from existence of such algorithm, especially in regards to the current knowledge about power of propagating scattered context grammars. Practical examples and implementation of proposed algorithm is also part of this thesis.

The master thesis describes in its introduction the deductive and inductive approach to teaching English grammar, compares them, and also lists the pros and cons of each approach. The main content of the theoretical part is the presentation of key concepts and principles of inductive teaching of English grammar. The practical part converts theoretical knowledge to real grammar teaching. Pupils learned how to express past events within four lessons. These sample lessons are examples of good practice of teaching grammar inductively. The reflection of these lessons is provided at the end of this part.

This work is divided into three major parts. The first one deals with parts of speech themselves {--} with what they are, with the criteria for sorting them and finally it presents the history of linguistic theories, related to the parts of speech. The second one presents the progress and results of bibliographic searches, during which we were looking for czech grammar books, dealing with French. The third part presents the actual analysis of manuals, that were found, focusing on the classification of the parts of speech.

The subject of this study is a suggestion and, within the framework of the possibility, a verification of the concept of teaching of Czech endings for foreigners without using samples. The study covers the declinations of nouns, adjectives and personal, demonstrative and possessive pronouns. In the development of our concept, we proceed from the fact that the Czech language, as well as the other Slavonic languages is characterized by significant level of endings' synonymy and homonymy. We use this fact as a reference point and create tables on its basis. The work consists theoretical and practical parts. The theoretical part is divided into two pieces. The first piece of the theoretical part is devoted to the different approaches to the problem of teaching endings for foreigners on the basic level. In the second piece, we introduce the new concept and explain the use of the tables based on homonymy, which are suggested in the practical part. The practical part is composed entirely of these twenty-five tables, which were created ready for use in teaching.

Master's thesis studies the possibilities of generating 3D trees using variety of methods including context-free grammars and L-systems. Master's thesis also includes chapter on evolutionary and genetic algorithms, which briefly summarize their function. In this project genetic algorithm which takes 2D image of tree and the beginning of its trunk is proposed. Based on this information it will generate 3D tree which is visually close to the original image. In addition to methods of generating trees, reader will get information about processing input image and designing test application.

This work introduces and discusses generalized scattered context grammars that are based upon sequences of productions whose left-hand sides are formed by nonterminal strings, not just single nonterminals. It places two restrictions on the derivations in these grammars. More specifically, let k be a constant. The first restriction requires that rewriting all symbols occurs within the first k symbols of the first continuous block of nonterminals in the sentential form during every derivation step. The other restriction defines the derivations over sentential forms containing no more than k occurrences of nonterminals. As its main result, the thesis demonstrates that both restrictions decrease the generative power of these grammars to the power of context-free grammars.

Tato disertační práce představuje derivační stromy několika různých typů gramatik ve zobecněné Kurodově normální formě; jmenovitě obecné a regulárně řízené gramatiky, gramatiky s rozptýleným kontextem a spolupracující distribuované gramatické systémy. Definuje jednoduché stromové rysy založené na kontextových vlastnostech jednotlivých diskutovaných gramatik a dokazuje, že pokud existuje limitující konstanta k taková, že každá věta generovaného jazyka L odpovídá řetězci listových uzlů derivačního stromu, ve kterém je výskyt definovaných stromových rysů omezen konstantou k, jazyk L je ve skutečnosti bezkontextový. Tato práce dále ukazuje, že dosažený výsledek představuje silný nástroj důkazu bezkontextovosti jazyka. Vše je doplněno příklady praktického využití nástroje.

Master thesis deals with L grammar systems. The basic types of grammar systems are studied. There are analyzed different types of L grammars and their use in field of plant development simulation. The work focuses on open L grammars. A parallel system consisting of open L grammars is designed. Communication takes place through the exchange of information between plants and their environment. Implemented is real kind of tree. Simulated is typical environment in which this kind of tree occurs normally. The system properties are examined from the point of view of simulation and the time-consuming interpretation of strings. At the end of this thesis there are described some other options of future development of the project together with the possibilities of using the proposed system.