Finiteness and Regularity in Semigroups and Formal Languages

This is a rigorous and self-contained monograph on a central topic in theoretical computer science: finiteness conditions for semigroups and regularity conditions for formal languages. For the first time in book form, original results from the last ten years are presented, some previously unpublished, using combinatorial and algebraic methods. These are mainly based on combinatorics on words and especially on the theory of "unavoidable regularities" in free monoids. Many finiteness conditions are considered, formulated in terms of such concepts as: permutability, iteration, repetitivity, and chain conditions. These give rise to regularity conditions for formal languages. Non-algebraic regularity conditions are also investigated. A background in mathematics and computer science is required.

שנה

1999

שפה

English

סדרה

Monographs in Theoretical Computer Science An EATCS Series, 1431-2654

הוצאה

Springer Berlin Heidelberg

מהדורות

1

עמודים

240

ISBN

9783642598494

מקור הנתונים: Wikidata