title: How would you prove an ordered language is regular?
body: <p>I want to know how to prove a language that has order constraints is regular. For example if you had that Σ = {1,2,3,4,5} where L (a subset of Σ*) = (a1,a2,...an) such that an+1 was larger than an how would you prove that this is a regular language?</p>
  
  <p>e.g α = (1,3,5) would be accepted, however α = (1,4,5,2) would not.</p>