You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This volume contains contributions from leading experts in the rapidly developing field of semigroup theory. The subject, now some 60 years old, began by imitating group theory and ring theory, but quickly developed an impetus of its own, and the semigroup turned out to be the most useful algebraic object in theoretical computer science.
The refereed proceedings of the 6th International Conference on Developments in Language Theory, DLT 2002, held in Kyoto, Japan in September 2002. The 28 revised full papers presented together with 8 invited papers were carefully reviewed and selected from 63 submissions. Among the topics addressed are grammars and acceptors for strings, graphs, arrays, etc; efficient algorithms for languages; combinatorial and algebraic properties of languages; decision problems; relations to complexity theory, logic picture description and analysis, DNA computing, cryptography, concurrency, quantum computing, and algebraic systems.
This conference celebrated the 65th birthday of Professor G B Preston of Monash University. Containing contributions from almost all his mathematical progeny, the proceedings is a tribute to his influence on semigroup and Australian mathematics.
Semigroups is a collection of papers dealing with models of classical statistics, sequential computing machine, inverse semi-groups. One paper explains the structure of inverse semigroups that leads to P-semigroups or E-unitary inverse semigroups by utilizing the P-theorem of W.D. Nunn. Other papers explain the characterization of divisibility in the category of sets in terms of images and relations, as well as the universal aspects of completely simple semigroups, including amalgamation, the lattice of varieties, and the Hopf property. Another paper explains finite semigroups which are extensions of congruence-free semigroups, where their set of congruences forms a chain. The paper then shows how to construct such semigroups. A finite semigroup (which is decomposable into a direct product of cyclic semigroups which are not groups) is actually uniquely decomposable. One paper points out when a finite semigroup has such a decomposition, and how its non-group cyclic direct factors, if any, can be found. The collection can prove useful for mathematicians, statisticians, students, and professors of higher mathematics or computer science.
The contributors present the main results and techniques of their specialties in an easily accessible way accompanied with many references: historical, hints for complete proofs or solutions to exercises and directions for further research. This volume contains applications which have not appeared in any collection of this type. The book is a general source of information in computation theory, at the undergraduate and research level.
This is an excellent collection of papers dealing with combinatorics on words, codes, semigroups, automata, languages, molecular computing, transducers, logics, etc., related to the impressive work of Gabriel Thierrin. This volume is in honor of Professor Thierrin on the occasion of his 80th birthday.