Algebraic recognizability of languages
| dc.creator | Weil, Pascal | |
| dc.date | 2006-09-19 | |
| dc.date.accessioned | 2026-07-07T07:23:55Z | |
| dc.date.available | 2026-07-07T07:23:55Z | |
| dc.description | Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this word-related notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. | |
| dc.identifier | https://arxiv.org/abs/cs/0609110 | |
| dc.identifier | http://arxiv.org/abs/cs/0609110 | |
| dc.identifier | Mathematical Foundations of Computer Science 2004, Tchèque, République (2004) 149-175 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116161 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Algebraic recognizability of languages | |
| dc.type | text |