Finiteness and Regularity in Semigroups and Formal Languages

Finiteness and Regularity in Semigroups and Formal Languages

by Aldo Luca

Part of Monographs in Theoretical Computer Science An EATCS Series

Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
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.

Discuss Finiteness and Regularity in Semigroups and Formal Languages with other readers

Join or start a book club for Finiteness and Regularity in Semigroups and Formal Languages on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Finiteness and Regularity in Semigroups and Formal Languages?

Sign up free on Readfeed, then browse public clubs or start your own club with Finiteness and Regularity in Semigroups and Formal Languages as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Finiteness and Regularity in Semigroups and Formal Languages with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Finiteness and Regularity in Semigroups and Formal Languages with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.