Decidability and Shortest Strings in Formal Languages

Details Decidability and Shortest Strings in Formal Languages Decidability and Shortest Strings in Formal Languages

2011-03-08

arxiv.org/abs/1103.1622v2

Computer Science

Formal Languages and Automata Theory

Scientific paper

Given a formal language L specified in various ways, we consider the problem
of determining if L is nonempty. If L is indeed nonempty, we find upper and
lower bounds on the length of the shortest string in L.

Affiliated with

Also associated with

No associations

Rating

Decidability and Shortest Strings in Formal 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 Decidability and Shortest Strings in Formal Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decidability and Shortest Strings in Formal Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-642719