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 7 Next

Displaying 121 – 140 of 222

Showing per page

Polynomials over the reals in proofs of termination : from theory to practice

Salvador Lucas (2010)

RAIRO - Theoretical Informatics and Applications

This paper provides a framework to address termination problems in term rewriting by using orderings induced by algebras over the reals. The generation of such orderings is parameterized by concrete monotonicity requirements which are connected with different classes of termination problems: termination of rewriting, termination of rewriting by using dependency pairs, termination of innermost rewriting, top-termination of infinitary rewriting, termination of context-sensitive rewriting, etc. We...

Polypodic codes

Symeon Bozapalidis, Olympia Louscou-Bozapalidou (2002)

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

Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.

Polypodic codes

Symeon Bozapalidis, Olympia Louscou–Bozapalidou (2010)

RAIRO - Theoretical Informatics and Applications

Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.

Porous media equation on locally finite graphs

Li Ma (2022)

Archivum Mathematicum

In this paper, we consider two typical problems on a locally finite connected graph. The first one is to study the Bochner formula for the Laplacian operator on a locally finite connected graph. The other one is to obtain global nontrivial nonnegative solution to porous-media equation via the use of Aronson-Benilan argument. We use the curvature dimension condition to give a characterization two point graph. We also give a porous-media equation criterion about stochastic completeness of the graph....

Positioned agents in eco-grammar systems with border markers and pure regulated grammars

Miroslav Langer, Alica Kelemenová (2012)

Kybernetika

In this paper we follow our previous research in the field of positioned agents in the eco-grammar systems and pure grammars. We extend model of the positioned eco-grammar systems by boundary markers and we introduce bordered positioned eco-grammar systems (BPEG systems, for short) and that way we show one of the possible answers to the question stated in [9]. Namely we compare generative power of the BPEG systems with three types of pure regulated grammars with appearance checking.

Possibilistic alternatives of elementary notions and relations of the theory of belief functions

Ivan Kramosil (2001)

Kybernetika

The elementary notions and relations of the so called Dempster–Shafer theory, introducing belief functions as the basic numerical characteristic of uncertainty, are modified to the case when probabilistic measures and basic probability assignments are substituted by possibilistic measures and basic possibilistic assignments. It is shown that there exists a high degree of formal similarity between the probabilistic and the possibilistic approaches including the role of the possibilistic Dempster...

Pour le monoïde plaxique

Marcel-Paul Schützenberger (1997)

Mathématiques et Sciences Humaines

Cet article est probablement le dernier texte de mathématiques écrit en vue de sa publication par M. P. Schützenberger, décédé en juillet 1996. Il était offert par son auteur en hommage à André Lentin, à l'occasion d'un colloque tenu en l'honneur de celui-ci le 23 février 1996 ; M. P. Schützenberger, déjà très malade, n'avait pu participer à cette rencontre, mais avait tenu à rédiger, non sans souffrances, une contribution scientifique qui témoignât de son amitié pour A. Lentin. Lorsque je lui dis...

Currently displaying 121 – 140 of 222