New Iteration Lemmata for Regular Languages

Authors:
Pál Dömösi;Manfred Kudlek
Affiliations:
Institute of Mathematics and Informatics, Debrecen University, Debrecen, Egyetem tér 1, H-4032 Hungary;(Correspd.) Fachbereich Informatik, Universität Hamburg, D-22527 Hamburg, Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany. kudlek@informatik.uni-hamburg.de
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2005

Citing 9
Cited 0

Computation and automata

Computation and automata
Formal languages

Formal languages
Introduction to computer theory (revised ed.)

Introduction to computer theory (revised ed.)
Regular languages

Handbook of formal languages, vol. 1
Automata and Languages

Automata and Languages
Theory of Computation: A Primer

Theory of Computation: A Primer
Introduction To Automata Theory, Languages, And Computation

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

Introduction to Formal Language Theory
A necessary and sufficient pumping lemma for regular languages

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using well-known characterizations of regular languages, on the basis of known iteration lemmas, new iteration lemmas for regular languages are given.