Lazard's Elimination (in traces) is finite-state recognizable

Details Lazard's Elimination (in traces) is finite-state recognizable Lazard's Elimination (in traces) is finite-state recognizable

2006-07-12

arxiv.org/abs/math/0607280v1

Mathematics

Combinatorics

Scientific paper

We prove that the codes issued from the elimination of any subalphabet in a
trace monoid are finite state recognizable. This implies in particular that the
transitive factorizations of the trace monoids are recognizable by (boolean)
finite-state automata.

Affiliated with

Also associated with

No associations

Rating

Lazard's Elimination (in traces) is finite-state recognizable 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 Lazard's Elimination (in traces) is finite-state recognizable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lazard's Elimination (in traces) is finite-state recognizable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-168797