A. de Luca and S. Varrichio, \A positive pumping condition for regular sets." Bulletin of the ETACS 39 (1989) 171-175. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
....that any suciently long string x in a regular language L can be written as x = yzw where yz n w 2 L for all n 0. This can often be used to show that a language is non regular. There are positive versions of the pumping lemma that are both necessary and sucient for a language to be regular [37]. 5. Rational formal power series. Consider the formal sum a b aa ab ba aaa aab aba baa bab aaaa : of all the words in L bb . This sum can be viewed as the expansion of the rational function 1 1 a ba (1 b) where a and b are non commuting variables and 1 = ....
A. de Luca and S. Varrichio, \A positive pumping condition for regular sets." Bulletin of the ETACS 39 (1989) 171-175.
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997) (7 citations) (Correct)
....that any sufficiently long string x in a regular language L can be written as x = yzw where yz n w 2 L for all n 0. This can often be used to show that a language is non regular. There are positive versions of the pumping lemma that are both necessary and sufficient for a language to be regular [32]. 5. Rational formal power series. Consider the formal sum ffl a b aa ab ba aaa aab aba baa bab aaaa : of all the words in L bb . This sum can be viewed as the expansion of the rational function 1 1 Gamma a Gamma ba (1 b) where a and b are non commuting ....
A. de Luca and S. Varrichio, "A positive pumping condition for regular sets." Bulletin of the ETACS 39 (1989) 171--175.
A Pumping Condition for Regular Sets - Varricchio (1997) Self-citation (Varricchio) (Correct)
....a necessary condition for a language to be regular. This condition alone does not enforce the regularity of a language, so one may be induced to consider stronger pumping properties in order to obtain conditions equivalent to regularity, and in fact many papers have been devoted to this problem [1], 3] 7] 8] The block pumping properties introduced in [3] are quite interesting. In that paper it is proved that the regularity of a language is equivalent to a block pumping property with a nonnegative pump. Moreover, it is questioned whether a positive block pumping property is a ....
....whether a positive block pumping property is a regularity condition. In this paper we will give a positive answer to that question, proving that a language of a finitely generated free monoid is regular if and only if it satisfies a block pumping property with positive pump. de Luca and Varricchio [1], 2] have given a partial answer to the problem when the pumping condition is assumed to be uniform. In this case the pumping property may be expressed as an iteration property of the syntactic monoid, and, for a language L, the problem is led back to the finiteness of M(L) In the following, A ....
[Article contains additional citation context not shown here]
A. de Luca and S. Varricchio, A positive pumping condition for regular sets, Bull. EATCS, 39 (1989), pp. 171--175.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC