Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages

Authors:
Pál Dömösi;Manfred Kudlek
Affiliations:
-;-
Venue:
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Year:
1999

Citing 7
Cited 1

Linear indexed languages

Theoretical Computer Science
Formal languages

Formal languages
Context-free languages

Handbook of theoretical computer science (vol. B)
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
A Generalization of Ogden's Lemma

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory

Introduction to Formal Language Theory

Parikh's theorem and descriptional complexity

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

New iteration lemmata are presented, generalizing most of the known iteration lemmata for regular, linear, context-free, and linear indexed languages.