Automata-theoretic methods in free monoids and free groups

Automata-theoretic methods in free monoids and free groups


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 3,718

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

Automata-theoretic tools have been deeply utilized in literature for studying algebraic matters, in particular free monoids and free groups. In this book we propose to study finitely generated submonoids of free monoids and finitely generated subgroups of free groups, and their intersection. Free monoids play an important role in combinatorics on words and in formal language theory. The study of submonoids of free monoids has been deepened by using combinatorial and automata methods in the setting of the theory of variable-length codes, started by M.P.Schützenberger. We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet by using an automata-theoretic approach. For what concerns free groups, several open problems have been solved and moreover several algorithms concerning group’s problems have been optimized using automata. We focus on algorithms constructing particular bases for a subgroup of a free group and in particular strongly reduced Nielsen bases. Using inverse automata we furnish two algorithms for the construction of a strongly Nielsen basis for a finitely generated subgroup.

Product Specifications
SKU :COC75462
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-10-08
0 Review(s)