Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Finiteness and Regularity in Semigroups and Formal Languages

by Aldo De Luca
Save 35% Save 35%
Current price ₹7,277.00
Original price ₹11,194.00
Original price ₹11,194.00
Original price ₹11,194.00
(-35%)
₹7,277.00
Current price ₹7,277.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9783642641503
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 240
  • Original Price: EUR 99.99
  • Language: English
  • Edition: Softcover Repri
  • Item Weight: 392 grams
  • BISAC Subject(s): Computer Science, Applied, and Algebra / General

The aim of this monograph is to present some recent research work on the combinatorial aspects of the theory of semigroups which are of great inter- est for both algebra and theoretical computer science. This research mainly concerns that part of combinatorics of finite and infinite words over a finite alphabet which is usually called the theory of "unavoidable" regularities. The unavoidable regularities ofsufficiently large words over a finite alpha- bet are very important in the study of finiteness conditions for semigroups. This problem consists in considering conditions which are satisfied by a fi- nite semigroup and are such as to assure that a semigroup satisfying them is finite. The most natural requirement is that the semigroup is finitely gener- ated. Ifone supposes that the semigroup is also periodic the study offiniteness conditions for these semigroups (or groups) is called the Burnside problem for semigroups (or groups). There exists an important relationship with the theory of finite automata because, as is well known, a language L over a fi- nite alphabet is regular (that is, recognizable by a finite automaton) if and only if its syntactic monoid S(L) is finite. Hence, in principle, any finite- ness condition for semigroups can be translated into a regularity condition for languages. The study of finiteness conditions for periodic languages (Le., such that the syntactic semigroup is periodic) has been called the Burnside problem for languages.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us