Regular Expression Quantifiers - at least m Occurrences
نویسندگان
چکیده
منابع مشابه
Regular Expression Quantifiers - at least m Occurrences
This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In the sequel, the quantifiers: at least m occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7]. The notation and terminology used here are int...
متن کاملOn distance-regular graphs with smallest eigenvalue at least -m
A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer m ≥ 2, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least −m, diameter at least three and intersection number c2 ≥ 2.
متن کاملMatroids with at least two regular elements
For a matroid M , an element e such that both M \ e and M/e are regular is called a regular element of M . We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small size matroids, all 3-connected matroids in the class can be pieced together from F7 or S8 and a regular matroid using 3-sums. This result takes a step toward solving a probl...
متن کاملRegular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
متن کاملAltitude of regular graphs with girth at least five
The altitude of a graph G is the largest integer k such that for each linear ordering f of its edges, G has a (simple) path P of length k for which f increases along the edge sequence of P . We determine a necessary and sufficient condition for cubic graphs with girth at least five to have altitude three and show that for r 4, r-regular graphs with girth at least five have altitude at least fou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2008
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-008-0005-3