Algebraic recognizability of languages
<|reference_start|>Algebraic recognizability of languages: 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.<|reference_end|>
@article{weil2006algebraic,
    title={Algebraic recognizability of languages},
    author={Pascal Weil (LaBRI)},
    journal={Mathematical Foundations of Computer Science 2004, Tch\`{e}que,
  R\'{e}publique (2004) 149-175},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0609110},
    primaryClass={cs.LO}
}