6 resultados para Bounded languages
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
We present the original proof, based on the Doitchinov completion, that a totally bounded quiet quasi-uniformity is a uniformity. The proof was obtained about ten years ago, but never published. In the mean-time several stronger results have been obtained by more direct arguments [8, 9, 10]. In particular it follows from Künzi’s [8] proofs that each totally bounded locally quiet quasi-uniform space is uniform, and recently Déak [10] observed that even each totally bounded Cauchy quasi-uniformity is a uniformity.
Resumo:
Sufficient conditions for the existence of bounded solutions of singularly perturbed impulsive differential equations are obtained. For this purpose integral manifolds are used.
Resumo:
* The research has been partially supported by Bulgarian Funding Organizations, sponsoring the Algebra Section of the Mathematics Institute, Bulgarian Academy of Sciences, a Contract between the Humboldt Univestit¨at and the University of Sofia, and Grant MM 412 / 94 from the Bulgarian Board of Education and Technology
Resumo:
A concept of educational game for learning programming languages is presented. The idea of learning programming languages and improving programming skills through programming game characters’ behavior is described. The learning course description rules for using in games are suggested. The concept is implemented in a game for learning C# programming language. A common game architecture is modified for using in the educational game. The game engine is built on the base of the graphical engine Ogre3D and extended with game logic. The game has been developed as an industry level commercial product and is planned for sale to educational institutions.
Resumo:
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.
Resumo:
2000 Mathematics Subject Classification: Primary 47A48, Secondary 60G12.