New Iteration Lemmata for Regular Languages

Issue title: Contagious Creativity – In Honor of the 80th Birthday of Professor Solomon Marcus

Article type: Research Article

Authors: Dömösi, Pál | Kudlek, Manfred

Affiliations: Institute of Mathematics and Informatics, Debrecen University, Debrecen, Egyetem tér 1, H-4032 Hungary | Fachbereich Informatik, Universität Hamburg, D-22527 Hamburg, Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany. kudlek@informatik.uni-hamburg.de

Note: [] Address for correspondence: Fachbereich Informatik, Universität Hamburg, D-22527 Hamburg, Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany

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

Keywords: Regular language, finite automaton, pumping lemma

Journal: Fundamenta Informaticae, vol. 64, no. 1-4, pp. 151-157, 2005