Sciweavers

922 search results - page 35 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
ITA
2000
15 years 1 months ago
On a paper by Castelli, Mignosi, Restivo
Fine and Wilf's theorem has recently been extended to words having three periods. Following the method of the authors we extend it to an arbitrary number of periods and deduce...
Jacques Justin
LOGCOM
2000
103views more  LOGCOM 2000»
15 years 1 months ago
A geometric proof of confluence by decreasing diagrams
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
ITA
2002
105views Communications» more  ITA 2002»
15 years 1 months ago
Polypodic codes
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...
Symeon Bozapalidis, Olympia Louscou-Bozapalidou
ORDER
2002
154views more  ORDER 2002»
15 years 1 months ago
Polyadic Concept Analysis
The framework and the basic results of Wille on triadic concept analysis, including his Basic Theorem of Triadic Concept Analysis, are here generalized to n-dimensional formal cont...
George Voutsadakis
98
Voted
JC
2010
95views more  JC 2010»
15 years 12 days ago
Stochastic perturbations and smooth condition numbers
In this paper we dene a new condition number adapted to directionally uniform perturbations in a general framework of maps between Riemannian manifolds. The denitions and theorem...
Diego Armentano