2000 character limit reached
Scattered one-counter languges have rank less than
Published 30 Jun 2020 in cs.FL | (2007.00090v2)
Abstract: A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is known that scattered context-free (regular, resp.) orderings have rank less than (, resp). In this paper we confirm the conjecture that one-counter languages have rank less than .
Paper Prompts
Sign up for free to create and run prompts on this paper.