On The Liniar Time Complexity of Finite Languages

Simple item page
dc.creatorMoscu, Mircea Alexandru Popescu
dc.date2005-01-05
dc.date.accessioned2026-07-07T03:22:20Z
dc.date.available2026-07-07T03:22:20Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/cs/0501009
dc.identifierhttp://arxiv.org/abs/cs/0501009
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32555
dc.subjectComputational Complexity
dc.titleOn The Liniar Time Complexity of Finite Languages
dc.typetext

Files

Collections

arXiv