Finiteness and Regularity in Semigroups and Formal Languages
by Aldo Luca
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.
Check nearby libraries
Buy this book
| Edition | Availability |
|---|---|
1
Finiteness and Regularity in Semigroups and Formal Languages
1999, Springer Berlin Heidelberg
electronic resource /
in English
3642598498 9783642598494
|
aaaa
|
Book Details
Edition Notes
Classifications
External Links
The Physical Object
Edition Identifiers
Work Identifiers
Source records
Community Reviews (0)
Lists
History
- Created June 30, 2019
- 3 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| March 28, 2025 | Edited by ImportBot | Redacting ocaids |
| December 25, 2021 | Edited by ImportBot | import existing book |
| June 30, 2019 | Created by MARC Bot | Imported from Internet Archive item record |