Absoluteness of subword inequality is undecidable

Details Absoluteness of subword inequality is undecidable Absoluteness of subword inequality is undecidable

2011-08-13

arxiv.org/abs/1108.2758v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

Mateescu, Salomaa, and Yu asked: is it decidable whether a given subword
history assumes only non-negative values for all words over a given alphabet.
In this paper, we solve this open problem by proving that this problem is
undecidable even under stronger conditions than supposed originally.

Affiliated with

Also associated with

No associations

Rating

Absoluteness of subword inequality is undecidable 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 Absoluteness of subword inequality is undecidable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Absoluteness of subword inequality is undecidable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636129