EUDML | Regular Expression Quantifiers - m to n Occurrences

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “ Regular Expression Quantifiers - m to n Occurrences ”

Characterizing Frobenius semigroups by filtration.

Johnson, Inga, Powers, Sean, Starr, Colin, Trevelyan, Charles, Webster, Craig (2009)

Journal of Integer Sequences [electronic only]

Similarity:

A curious identity involving binomial coefficients.

Sun, Zhiwei (2002)

Integers

Similarity:

On a linear Diophantine problem of Frobenius.

Tripathi, Amitabha (2006)

Integers

Similarity:

A common generalization of some identities.

Zhang, Zhizheng, Wang, Jun (2005)

Integers

Similarity:

Some local asymptotic laws for the Cauchy process on the line.

Okoroafor, A.Chukwuemeka (2007)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

On variants of Conway and Conolly's meta-Fibonacci recursions.

Isgur, Abraham, Rahman, Mustazee (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A simple proof of the geometric-arithmetic mean inequality.

Uchida, Yasuharu (2008)

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

Similarity:

Full subsets of $ℕ$ .

Naranjani, Lila, Mirzavaziri, Madjid (2011)

Journal of Integer Sequences [electronic only]

Similarity:

Gruppy Prostoi i Kratnoi Antisimmetrii Lent

Slavik Jablan (1987)

Publications de l'Institut Mathématique

Similarity:

How to characterize commutativity equalities for Drazin inverses of matrices

Yong Ge Tian (2003)

Archivum Mathematicum

Similarity:

Necessary and sufficient conditions are presented for the commutativity equalities $A^{*} A^{D} = A^{D} A^{*}$ , $A^{†} A^{D} = A^{D} A^{†}$ , $A^{†} A A^{D} = A^{D} A A^{†}$ , $A A^{D} A^{*} = A^{*} A^{D} A$ and so on to hold by using rank equalities of matrices. Some related topics are also examined.