Finiteness and Regularity in Semigroups and Formal Languages

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Aldo de Luca, Stefano Varricchio
Series: Monographs in Theoretical Computer Science An EATCS Series
Publisher: Springer
Year: 1999

Language: English
Pages: 248
Tags: Logics and Meanings of Programs; Software Engineering; Symbolic and Algebraic Manipulation; Data Structures; Algebra

Front Matter....Pages I-X
Combinatorics on Words....Pages 1-30
Unavoidable Regularities....Pages 31-76
Finiteness Conditions for Semigroups....Pages 77-152
Finitely Recognizable Semigroups....Pages 153-177
Regularity Conditions....Pages 179-194
Well Quasi-orders and Regularity....Pages 195-227
Back Matter....Pages 229-242