A note on the pumping lemma for regular languages

Amiram Yehudai

doi:10.1016/0020-0190(79)90054-1

A note on the pumping lemma for regular languages

Amiram Yehudai^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	135-136
Number of pages	2
Journal	Information Processing Letters
Volume	9
Issue number	3
DOIs	https://doi.org/10.1016/0020-0190(79)90054-1
State	Published - 5 Oct 1979

Keywords

Regular languages
reduced finite automata

Access to Document

10.1016/0020-0190(79)90054-1

Cite this

@article{7a70514d63224059a9f3afba20324fb9,

title = "A note on the pumping lemma for regular languages",

keywords = "Regular languages, reduced finite automata",

author = "Amiram Yehudai",

year = "1979",

month = oct,

day = "5",

doi = "10.1016/0020-0190(79)90054-1",

language = "אנגלית",

volume = "9",

pages = "135--136",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - A note on the pumping lemma for regular languages

AU - Yehudai, Amiram

PY - 1979/10/5

Y1 - 1979/10/5

KW - Regular languages

KW - reduced finite automata

UR - http://www.scopus.com/inward/record.url?scp=49249146351&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(79)90054-1

DO - 10.1016/0020-0190(79)90054-1

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:49249146351

SN - 0020-0190

VL - 9

SP - 135

EP - 136

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

A note on the pumping lemma for regular languages

Keywords

Access to Document

Other files and links

Cite this