Overview

"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."

Full Product Details

Author:   J.B. Fountain
Publisher:   Springer
Imprint:   Springer
Edition:   Softcover reprint of the original 1st ed. 1995
Volume:   466
Dimensions:   Width: 16.00cm , Height: 2.30cm , Length: 24.00cm
Weight:   0.698kg
ISBN:  

9789401040679

ISBN 10:   9401040672
Pages:   428
Publication Date:   21 October 2012
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Finite semigroups and recognizable languages.- BG = PG: A success story.- Semigroups and automata on infinite words.- Relatively free profinite monoids.- Logics for regular languages, finite monoids, and circuit complexity.- Algorithmic problems in groups, semigroups and inverse semigroups.- Geometric methods in combinatorial semigroup theory.- An introduction to automatic groups.- to ?-trees.- An introduction to reductive monoids.- Monoids of Lie type.- Finite reductive monoids.- Modular representations of finite monoids of Lie type.- Cascade decomposition of arbitrary semigroups.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions