On The Liniar Time Complexity of Finite Languages

Details On The Liniar Time Complexity of Finite Languages On The Liniar Time Complexity of Finite Languages

2005-01-05

arxiv.org/abs/cs/0501009v1

Computer Science

Computational Complexity

Scientific paper

The present paper presents and proves a proposition concerning the time
complexity of finite languages. It is shown herein, that for any finite
language (a language for which the set of words composing it is finite) there
is a Turing machine that computes the language in such a way that for any input
of length k the machine stops in, at most, k + 1 steps.

Affiliated with

Also associated with

No associations

Rating

On The Liniar Time Complexity of Finite 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 On The Liniar Time Complexity of Finite Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On The Liniar Time Complexity of Finite Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-531796