1975
DOI: 10.1051/ita/197509r200131
|View full text |Cite
|
Sign up to set email alerts
|

A pumping theorem for deterministic ETOL languages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

1976
1976
2012
2012

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Bar-Hillel, Perles, and Shamir 121 found a pumping lemma for context-free languages and recently Ehrenfeucht and Rozenberg [3] found that deterministic ETOL languages have a similar property. In this paper we study some classes of languages having a pumping property.…”
Section: Introductionmentioning
confidence: 93%
“…Bar-Hillel, Perles, and Shamir 121 found a pumping lemma for context-free languages and recently Ehrenfeucht and Rozenberg [3] found that deterministic ETOL languages have a similar property. In this paper we study some classes of languages having a pumping property.…”
Section: Introductionmentioning
confidence: 93%
“…r . The number of/-random words for a function ƒ which is not "too slow" over an alphabet consisting of at least two letters is "rather large" which is stated in the following theorem proved in [5]. …”
mentioning
confidence: 99%