All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 98 Next

Displaying 1941 – 1960 of 4962

Showing per page

Free associative algebras, noncommutative Gröbner bases, and universal associative envelopes for nonassociative structures

Murray R. Bremner (2014)

Commentationes Mathematicae Universitatis Carolinae

First, we provide an introduction to the theory and algorithms for noncommutative Gröbner bases for ideals in free associative algebras. Second, we explain how to construct universal associative envelopes for nonassociative structures defined by multilinear operations. Third, we extend the work of Elgendy (2012) for nonassociative structures on the 2-dimensional simple associative triple system to the 4- and 6-dimensional systems.

Free group languages : rational versus recognizable

Pedro V. Silva (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several...

Free group languages: Rational versus recognizable

Pedro V. Silva (2010)

RAIRO - Theoretical Informatics and Applications

We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several...

Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages

Marco Caminati (2011)

Formalized Mathematics

Fourth of a series of articles laying down the bases for classical first order model theory. This paper supplies a toolkit of constructions to work with languages and interpretations, and results relating them. The free interpretation of a language, having as a universe the set of terms of the language itself, is defined.The quotient of an interpreteation with respect to an equivalence relation is built, and shown to remain an interpretation when the relation respects it. Both the concepts of quotient...

Free Term Algebras

Grzegorz Bancerek (2012)

Formalized Mathematics

We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler algebras...

Frequency planning and ramifications of coloring

Andreas Eisenblätter, Martin Grötschel, Arie M.C.A. Koster (2002)

Discussiones Mathematicae Graph Theory

This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are T-coloring and...

From Bi-ideals to Periodicity

Jānis Buls, Aivars Lorencs (2008)

RAIRO - Theoretical Informatics and Applications

The necessary and sufficient conditions are extracted for periodicity of bi-ideals. They cover infinitely and finitely generated bi-ideals.

From computing with numbers to computing with words - From manipulation of measurements to manipulation of perceptions

Lotfi Zadeh (2002)

International Journal of Applied Mathematics and Computer Science

Computing, in its usual sense, is centered on manipulation of numbers and symbols. In contrast, computing with words, or CW for short, is a methodology in which the objects of computation are words and propositions drawn from a natural language, e.g., small, large, far, heavy, not very likely, the price of gas is low and declining, Berkeley is near San Francisco, it is very unlikely that there will be a significant increase in the price of oil in the near future, etc. Computing with words is inspired...

From ignorance to uncertainty: a conceptual analysis

Pietro Baroni, Giovanni Guida, Silvano Mussi (1998)

Kybernetika

This paper aims to develop an analysis of how ignorance affects the reasoning activity and is related to the concept of uncertainty. With reference to a simple inferential reasoning step, involving a single piece of relational knowledge, we identify four types of ignorance and show how they give rise to different types of uncertainty. We then introduce the concept of reasoning attitude, as a basic choice about how reasoning should be carried out in presence of ignorance. We identify two general...

From indexed grammars to generating functions

Jared Adams, Eric Freden, Marni Mishna (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We extend the DSV method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.

From Pixels and Minds to the Mathematical Knowledge in a Digital Library

Sojka, Petr, Rákosník, Jiří (2008)

Towards Digital Mathematics Library. Birmingham, United Kingdom, July 27th, 2008

Experience in setting up a workflow from scanned images of mathematical papers into a fully fledged mathematical library is described on the example of the project Czech Digital Mathematics Library DML-CZ. An overview of the whole process is given, with description of all main production steps. DML-CZ has recently been launched to public with more than 100,000 digitized pages.

From the Slit-Island Method to the Ising model: Analysis of irregular grayscale objects

Przemysław Mazurek, Dorota Oszutowska-Mazurek (2014)

International Journal of Applied Mathematics and Computer Science

The Slit Island Method (SIM) is a technique for the estimation of the fractal dimension of an object by determining the area-perimeter relations for successive slits. The SIM could be applied for image analysis of irregular grayscale objects and their classification using the fractal dimension. It is known that this technique is not functional in some cases. It is emphasized in this paper that for specific objects a negative or an infinite fractal dimension could be obtained. The transformation...

Currently displaying 1941 – 1960 of 4962