## Algebraic recognizability of languages (2004)

Venue: | In Proc. 29th Int. Symp. Math. Found. of Comp. Sci. (MFCS’04 |

Citations: | 11 - 3 self |

### BibTeX

@INPROCEEDINGS{Weil04algebraicrecognizability,

author = {Pascal Weil},

title = {Algebraic recognizability of languages},

booktitle = {In Proc. 29th Int. Symp. Math. Found. of Comp. Sci. (MFCS’04},

year = {2004},

pages = {149--175},

publisher = {Springer}

}

### OpenURL

### Abstract

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. In the beginning was the Word... 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 wordrelated notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. The notion of recognizable languages is a familiar one, associated with classical theorems by Kleene, Myhill, Nerode, Elgot, Büchi, Schützenberger, etc. It can be approached from several angles: recognizability by automata, recognizability by finite monoids or finite-index congruences, rational expressions, monadic second