A pumping lemma for \textbf{DLI}-languages

DOI10.1016/S0012-365X(02)00265-0zbMath1052.68077OpenAlexW2009122915WikidataQ124810551 ScholiaQ124810551MaRDI QIDQ1850045

L. Kászonyi

Publication date: 2 December 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00265-0

zbMATH Keywords

bounded context-free languagesStratified linear sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Context-Freeness of Word-MIX Languages

This page was built for publication: A pumping lemma for \textbf{DLI}-languages