Detecting patterns in finite regular and context-free languages

Details Detecting patterns in finite regular and context-free languages Detecting patterns in finite regular and context-free languages

2009-06-17

arxiv.org/abs/0906.3220v1

Computer Science

Formal Languages and Automata Theory

9 pages

Scientific paper

We consider variations on the following problem: given an NFA M and a pattern p, does there exist an x in L(M) such that p matches x? We consider the restricted problem where M only accepts a finite language. We also consider the variation where the pattern p is required only to match a factor of x. We show that both of these problems are NP-complete. We also consider the same problems for context-free grammars; in this case the problems become PSPACE-complete.

Affiliated with

Also associated with

No associations

Rating

Detecting patterns in finite regular and context-free 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 Detecting patterns in finite regular and context-free languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting patterns in finite regular and context-free languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223542