A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Many years ago it was observed that the r.e. languages form an infinite proper hierarchy RE1 ⊂ RE2 ⊂ · · · based on the size of the Turing machines that accept them. Aside from some basic facts, little seems known about it in general. We examine the position of the finite languages and their complements in the hierarchy. We show that for every finite language L one has L,L ∈ REn for some n ≤ p·(m− log 2 p +1)+1 where m is the length of the longest word in L, c is the cardinality of L, and p =doi:10.1142/s0129054115500380 fatcat:a3egpgjiwjbn7jvnqhgawogno4