Semigroups, Formal Languages and Groups by J.B. FountainSemigroups, Formal Languages and Groups by J.B. Fountain

Semigroups, Formal Languages and Groups

byJ.B. Fountain

Paperback | October 21, 2012

Pricing and Purchase Info

$339.71 online 
$398.95 list price save 14%
Earn 1,699 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This volume presents the core of invited expository lectures given at the 1993 NATO ASI held at the University of York. The subject matter of the ASI was the interplay between automata, semigroups, formal languages and groups. The invited talks were of an introductory nature but at a high level and many reached the cutting edge of research in the area. The lectures were given to a mixed group of students and specialists and were designed to be accessible to a broad audience. The papers were written in a similar spirit in the hope that their readership will be as wide as possible. With one exception they are all based on the talks which the lecturers gave at the meeting. The exception is caused by the fact that due to unanticipated progress the topic of John Rhodes' talk is now in such a state of flux that it has not been possible to produce a paper giving a clear picture of the situation. However, we do include an article by a member of the "Rhodes school" , namely Christopher Nehaniv, expanding on a contributed talk he gave. It generalizes the celebrated Krohn-Rhodes theorem for finite semigroups to all semigroups. For many years there has been a strong link between formal language theory and the theory of semigroups. Each subject continues to influence the other.
Title:Semigroups, Formal Languages and GroupsFormat:PaperbackDimensions:428 pagesPublished:October 21, 2012Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:9401040672

ISBN - 13:9789401040679

Reviews

Table of Contents

Foreword. Finite semigroups and Recognizable Languages; J. E. Pin. BG=PG: A Success Story; J. E. Pin. Semigroups and Automata on Infinite Words; D. Perrin, J. E. Pin. Relatively Free Profinite Monoids; J. Almeida, P. Weil. Logics for Regular Languages, Finite Monoids, and Circuit Complexity; H. Strawbing, et al. Algorithmic Problems in Groups, Semigroups and Inverse Semigroups; S. Margolis, et al. Geometric Methods in Combinatorial Semigroup Theory; S. J. Pride. An Introduction to Automatic Groups; H. Short. Introduction to Lambda-Trees; I. M. Chiswell. An Introduction to Reductive Monoids; L. Solomon. Monoids of Lie Type; M. S. Putcha. Finite Reductive Monoids; L. E. Renner. Modular Representations of Finite Monoids of Lie Type; L. E. Renner. Cascade Decomposition of Arbitrary Semigroups; C. L. Nehaniv. Index.