Semigroups, Algorithms, Automata, and Languages: Coimbra, Portugal, May-July 2001The thematic term on ?Semigroups, Algorithms, Automata and Languages? organized at the International Centre of Mathematics (Coimbra, Portugal) in May-July 2001 was the gathering point for researchers working in the field of semigroups, algorithms, automata and languages. These areas were selected considering their huge recent developments, their potential applications, and the motivation from other fields of mathematics and computer science.This proceedings volume is a unique collection of advanced courses and original contributions on semigroups and their connections with logic, automata, languages, group theory, discrete dynamics, topology and complexity. A selection of open problems discussed during the thematic term is also included. |
Other editions - View all
Common terms and phrases
2-complex algorithm Almeida alphabet aperiodic asynchronously automatic automatic structure automaton bi-identities bifree boolean Cayley graph class of finite Comput congruence conjecture consider containing context-free continuous homomorphism Corollary defined definition denote E-solid E-unitary elements equivalent evaluation example exists finite groups finite monoids finite semigroups finite set free group free monoid FUNDAQAO given graph group G groupoid Hence hyperbolic idempotent identity implicit operations integer inverse monoid inverse semigroup isomorphism Lemma M-variety mapping Math obtained ordered monoids orthodox semigroups partial path presentation pro-C group pro-V algebra profinite groups profinite topology Proof Proposition proved pseudoidentities pseudovariety Q-ring rational recognizable languages Rees matrix semigroup regular semigroups relational morphism resp respect ring satisfies Schützenberger Section semi semidirect product Semigroup Forum semilattice semiring subgroup submonoid subsemigroup subset surjective syntactic monoid T-class Theorem theory topology unary unique variables vertex