Results 271 to 280 of about 1,488,319 (298)
Some of the next articles are maybe not open access.
Connecting Partial Words and Regular Languages
2012We initiate a study of languages of partial words related to regular languages of full words. First, we study the possibility of expressing a regular language of full words as the image of a partial-words-language through a substitution that only replaces the hole symbols of the partial words with a finite set of letters.
Jürgen Dassow +2 more
openaire +2 more sources
Partial Derivatives of an Extended Regular Expression
2011The notion of expression derivative due to Brzozowski leads to the construction of a deterministic automaton from an extended regular expression, whereas the notion of partial derivative due to Antimirov leads to the construction of a non-deterministic automaton from a simple regular expression.
Pascal Caron +2 more
openaire +2 more sources
Partially Self-Injective Regular Rings
Canadian Mathematical Bulletin, 1973AbstractIt is proved, for any uncountable cardinal λ, that a λ-complete Boolean ring is λ-self-injective. An example shows that the converse need not hold.
openaire +1 more source
Quasiconvexity and partial regularity in the calculus of variations
Archive for Rational Mechanics and Analysis, 1986The author proves the following regularity theorem: Let \(F: {\mathbb{R}}^{nN}\to {\mathbb{R}}\) be a \(C^ 2\)-function satisfying \(| D^ 2F| \leq\) constant. Let us assume also that F is uniformly strictly quasiconvex, in the sense that \[ \int_{B(x,r)}(F(\xi)+\gamma | D\phi (y)|^ 2)dy\leq \int_{B(x,r)}F(\xi +D\phi (y))dy, \] for some \(\gamma >0 ...
openaire +1 more source
Strongly regular vertices and partially strongly regular graphs.
Ars Comb., 2004Summary: A strongly regular vertex with parameters \((\lambda,\mu)\) in a graph is a vertex \(x\) such that the number of neighbors any other vertex \(y\) has in common with \(x\) is \(\lambda\) if \(y\) is adjacent to \(x\), and is \(\mu\) if \(y\) is not adjacent to \(x\).
openaire +2 more sources
Regularized Partial Matching of Rigid Shapes
2008Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A particularly challenging setting of this problem is partial matching, where the two shapes are dissimilar in general, but have significant similar parts.
Alexander M. Bronstein +1 more
openaire +1 more source
Existence and partial regularity results for the heat flow for harmonic maps
Mathematische Zeitschrift, 1989Michael Struwe
exaly
A note on regularity criterion for the 3D Boussinesq system with partial viscosity
Applied Mathematics Letters, 2009Jishan Fan
exaly
On Partial Regularity for the 3D Nonstationary Hall Magnetohydrodynamics Equations on the Plane
SIAM Journal on Mathematical Analysis, 2016Jörg Wolf, Dongho Chae
exaly
Partial regularity of finite Morse index solutions to the Lane–Emden equation
Journal of Functional Analysis, 2011Juan Davila +2 more
exaly

