See this document in CiteSeerX!

A Pumping Condition for Regular Sets (1997)  (Make Corrections)  
Stefano Varricchio
SIAM Journal on Computing



  Home/Search   Context   Related

 
View or download:
siam.org/sambin/getfile/S...17994.ps.Z


From:  siam.org/sambin/dbq/arti...17994 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . We prove that a language of a finitely generated free monoid is regular if and only if it satisfies the positive block pumping property. This gives a positive answer to a problem posed by Ehrenfeucht, Parikh, and Rozenberg [SIAM J. Comput., 10 (1981), pp. 536--541]. Key words. automata theory, regular languages, pumping conditions AMS subject classifications. 68Q45, 20M35 PII. S0097539790179944 1. Introduction. Pumping properties have always had great importance in formal languages theory and ... (Update)

Active bibliography (related documents):   More   All
0.5:   A New Approach to Formal Language Theory by Kolmogorov.. - Li, Vitányi (1995)   (Correct)
0.3:   Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997)   (Correct)
0.3:   A Short History of Computational Complexity - Fortnow, Homer (2002)   (Correct)

Similar documents based on text:   More   All
0.5:   Developing Aquifer Properties from a Multi-Stage Pump.. - Regmi, Deschaine.. (2001)   (Correct)
0.4:   A Pumping Lemma for Output Languages of Macro Tree Transducers - Kühnemann   (Correct)
0.4:   Test Results of a Combined Distributed Ion.. - Holdener, Behne..   (Correct)

BibTeX entry:   (Update)

@article{ varricchio97pumping,
    author = "Stefano Varricchio",
    title = "A Pumping Condition for Regular Sets",
    journal = "SIAM Journal on Computing",
    volume = "26",
    number = "3",
    pages = "764--771",
    year = "1997",
    url = "citeseer.ist.psu.edu/varricchio97pumping.html" }
Citations (may not include all citations):
1911   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
110   Ramsey Theory (context) - Graham, Rotshild et al. - 1990
9   Languages and Machines (context) - Eilemberg - 1974
9   Linear automata transformations (context) - Nerode - 1958
3   A positive pumping condition for regular sets (context) - de Luca, Varricchio - 1989
3   Wright--Patterson Air Force Base (context) - Myhill, automata et al. - 1957
2   Pumping lemmas for regular sets (context) - Ehrenfeucht, Parikh et al. - 1981
1   A necessary and su#cient pumping lemma for regular languages (context) - Jaffe - 1978
1   Notes on congruences relations and factor pumping conditions.. (context) - Hashigushi - 1988
1   Finiteness and iteration conditions for semigroups (context) - de Luca, Varricchio - 1991
1   Poincare recurrence and number theory (context) - Fustemberg - 1981

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