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.

Data and Resources

Additional Info

Field Value
Source Mathematical Foundations of Computer Science 2004
Author Weil, Pascal
Maintainer CCSD
Last Updated May 5, 2026, 20:34 (UTC)
Created May 5, 2026, 20:34 (UTC)
Identifier hal-00096619
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Laboratoire Bordelais de Recherche en Informatique (LaBRI) ; Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)
coverage Prague, Czech Republic
creator Weil, Pascal
date 2004-05-05T00:00:00
harvest_object_id 7810d5c3-6dbe-4581-992d-e5731a7adc0e
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-05-26T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/cs.DM/0609110
set_spec type:COMM