LATA 2012 Language and Automata Theory and Applications
 |  |
Wall of Fame | Most Viewed LATA-2012 Paper
LATA
2012
Springer
12 years 2 days 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 ...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 301 | ||
| 2 | | 296 | ||
| 3 | | 252 |