167
click to vote
LATA
2012
Springer
13 years 10 months ago
2012
Springer
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is ...