Comparing Entire Prototypes at Semigroup Homomorphisms and Specifically at Regular Languages Substitutions

The following statements are proven: A correspondence of a semigroup in another one is a homomorphism if and only if when the entire prototype of the product of images contains (always) the product of their entire prototypes. The Kleene closure of the maximal rewriting of a regular language at a regular language substitution contains in the maximal rewriting of the Kleene closure of the initial regular language at the same substitution. Let the image of the maximal rewriting of a regular language at a regular language substitution covers the entire given regular language. Then the image of any word from the maximal rewriting of the Kleene closure of the initial regular language covers by the image of a set of some words from the Kleene closure of the maximal rewriting of this given regular language everything at the same given regular language substitution. The purposefulness of the ¯rst statement is substantiated philosophically and epistemologically connected with the spirit of previous mathematical results of the author. A corollary of its is indicated about the membership problem at a regular substitution.

The Doitchinov Completion of a Regular Paratopological Group

In memory of Professor D. Doitchinov ∗ This paper was written while the first author was supported by the Swiss National Science Foundation under grants 21–30585.91 and 2000-041745.94/1 and by the Spanish Ministry of Education and Sciences under DGES grant SAB94-0120. The second author was supported under DGES grant PB95-0737. During her stay at the University of Berne the third author was supported by the first author’s grant 2000-041745.94/1 from the Swiss National Science Foundation.

A Mathematical Apparatus for Ontology Simulation. Specialized Extensions of the Extendable Language of Applied Logic

* This paper was made according to the program of fundamental scientific research of the Presidium of the Russian Academy of Sciences «Mathematical simulation and intellectual systems», the project "Theoretical foundation of the intellectual systems based on ontologies for intellectual support of scientific researches".

Ontology-Based Model of Representation of Knowledge about Language Mappings

The paper presents a short review of some systems for program transformations performed on the basis of the internal intermediate representations of these programs. Many systems try to support several languages of representation of the source texts of programs and solve the task of their translation into the internal representation. This task is still a challenge as it is effort-consuming. To reduce the effort, different systems of translator construction, ready compilers with ready grammars of outside designers are used. Though this approach saves the effort, it has its drawbacks and constraints. The paper presents the general idea of using the mapping approach to solve the task within the framework of program transformations and overcome the disadvantages of the existing systems. The paper demonstrates a fragment of the ontology model of high-level languages mappings onto the single representation and gives the example of how the description of (a fragment) a particular mapping is represented in accordance with the ontology model.

Classification of the Maximal Subsemigroups of the Semigroup of all Partial Order-Preserving Transformations

Илинка А. Димитрова, Цветелина Н. Младенова - Моноида P Tn от всички частични преобразования върху едно n-елементно множество относно операцията композиция на преобразования е изучаван в различни аспекти от редица автори. Едно частично преобразование α се нарича запазващо наредбата, ако от x ≤ y следва, че xα ≤ yα за всяко x, y от дефиниционното множество на α. Обект на разглеждане в настоящата работа е моноида P On състоящ се от всички частични запазващи наредбата преобразования. Очевидно P On е под-моноид на P Tn. Направена е пълна класификация на максималните подполугрупи на моноида P On. Доказано е, че съществуват пет различни вида максимални подполугрупи на разглеждания моноид. Броят на всички максимални подполугрупи на POn е точно 2^n + 2n − 2.

The Maximal Number of Particles in a Branching Process with State-Dependent Immigration

AMS subject classification: 60J80, 60J15.

Maximal Number of Successors in a Nginar(1) Process

2000 Mathematics Subject Classification: 60J80, 60J20, 60J10, 60G10, 60G70, 60F99.

Automated Generating of Test Units for Evaluation of Cognitive and Language Skills

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2016

Regular and Other Kinds of Extensions of Topological Spaces

∗ This work was partially supported by the National Foundation for Scientific Researches at the Bulgarian Ministry of Education and Science under contract no. MM-427/94.

A Mathematical Apparatus for Domain Ontology Simulation. An Extendable Language of Applied Logic

* This paper was made according to the program of fundamental scientific research of the Presidium of the Russian Academy of Sciences «Mathematical simulation and intellectual systems», the project "Theoretical foundation of the intellectual systems based on ontologies for intellectual support of scientific researches".

Language Resources – a Part of World Cultural Heritage

This article briefly reviews multilingual language resources for Bulgarian, developed in the frame of some international projects: the first-ever annotated Bulgarian MTE digital lexical resources, Bulgarian-Polish corpus, Bulgarian-Slovak parallel and aligned corpus, and Bulgarian-Polish-Lithuanian corpus. These resources are valuable multilingual dataset for language engineering research and development for Bulgarian language. The multilingual corpora are large repositories of language data with an important role in preserving and supporting the world's cultural heritage, because the natural language is an outstanding part of the human cultural values and collective memory, and a bridge between cultures.

Bilingual Corpus - Digital Repository for Preservation of Language Heritage

The article briefly reviews bilingual Slovak-Bulgarian/Bulgarian-Slovak parallel and aligned corpus. The corpus is collected and developed as results of the collaboration in the frameworks of the joint research project between Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, and Ľ. Štúr Institute of Linguistics, Slovak Academy of Sciences. The multilingual corpora are large repositories of language data with an important role in preserving and supporting the world's cultural heritage, because the natural language is an outstanding part of the human cultural values and collective memory, and a bridge between cultures. This bilingual corpus will be widely applicable to the contrastive studies of the both Slavic languages, will also be useful resource for language engineering research and development, especially in machine translation.