Algebraic recognizability of languages
Logic in Computer Science
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.cs/0609110,
title = {Algebraic recognizability of languages},
author = {Pascal Weil},
journal= {arXiv preprint arXiv:cs/0609110},
year = {2007}
}