A shrinking lemma for indexed languages

Robert H. Gilman

doi:10.1016/0304-3975(96)00244-7

A shrinking lemma for indexed languages

Robert H. Gilman

Department of Mathematical Sciences

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

27 Scopus citations

Abstract

This article presents a lemma in the spirit of the pumping lemma for indexed languages but easier to employ.

Original language	English
Pages (from-to)	277-281
Number of pages	5
Journal	Theoretical Computer Science
Volume	163
Issue number	1-2
DOIs	https://doi.org/10.1016/0304-3975(96)00244-7
State	Published - 30 Aug 1996

Access to Document

10.1016/0304-3975(96)00244-7

Cite this

@article{67c679985e26461b8af0d89133d24e78,

title = "A shrinking lemma for indexed languages",

abstract = "This article presents a lemma in the spirit of the pumping lemma for indexed languages but easier to employ.",

author = "Gilman, \{Robert H.\}",

year = "1996",

month = aug,

day = "30",

doi = "10.1016/0304-3975(96)00244-7",

language = "English",

volume = "163",

pages = "277--281",

number = "1-2",

}

TY - JOUR

T1 - A shrinking lemma for indexed languages

AU - Gilman, Robert H.

PY - 1996/8/30

Y1 - 1996/8/30

N2 - This article presents a lemma in the spirit of the pumping lemma for indexed languages but easier to employ.

AB - This article presents a lemma in the spirit of the pumping lemma for indexed languages but easier to employ.

UR - https://www.scopus.com/pages/publications/0030215992

UR - https://www.scopus.com/pages/publications/0030215992#tab=citedBy

U2 - 10.1016/0304-3975(96)00244-7

DO - 10.1016/0304-3975(96)00244-7

M3 - Article

AN - SCOPUS:0030215992

SN - 0304-3975

VL - 163

SP - 277

EP - 281

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

A shrinking lemma for indexed languages

Abstract

Access to Document

Other files and links

Fingerprint

Cite this