Papers
Topics
Authors
Recent
2000 character limit reached

Scattered one-counter languges have rank less than $ω^2$ (2007.00090v2)

Published 30 Jun 2020 in cs.FL

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

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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