Algebraic recognizability of languages
classification
💻 cs.LO
keywords
languagesalgebraicapplicationsbehaviorsbrieflycomplexcomputercornerstone
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.