The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
About this item
Full title
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
Author / Creator
Publisher
Boston: Springer US
Journal title
Theory of computing systems, 2014-07, Vol.55 (1), p.250-278
Language
English
Formats
Publication information
Publisher
Boston: Springer US
Subjects
More information
Scope and Contents
Contents
Seki et al. (Theor. Comput. Sci. 88(2):191–229,
1991
) showed that every
m
-multiple context-free language
L
is weakly 2
m
-iterative in the sense that either
L
is finite or
L
contains a subset of the form
, where
w
1
⋯
w
2
n
≠
ε
. Whether every
m
-multiple context-free languag...
Alternative Titles
Full title
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_hal_primary_oai_HAL_hal_01251232v1
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_hal_primary_oai_HAL_hal_01251232v1
Other Identifiers
ISSN
1432-4350
E-ISSN
1433-0490
DOI
10.1007/s00224-014-9534-z
