Papers
Topics
Authors
Recent
Search
2000 character limit reached

Scattered one-counter languges have rank less than $ω^2$

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 $\omega\omega$ ($\omega$, resp). In this paper we confirm the conjecture that one-counter languages have rank less than $\omega2$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.