Algebraic recognizability of languages

Details Algebraic recognizability of languages Algebraic recognizability of languages

2006-09-19

arxiv.org/abs/cs/0609110v1

Mathematical Foundations of Computer Science 2004, Tch\`{e}que, R\'{e}publique (2004) 149-175

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algebraic recognizability of languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic recognizability of languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic recognizability of languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465639