2012
DOI: 10.1007/978-3-642-29344-3_25
|View full text |Cite
|
Sign up to set email alerts
|

Hausdorff Rank of Scattered Context-Free Linear Orders

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
16
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
3

Relationship

6
1

Authors

Journals

citations
Cited by 8 publications
(18 citation statements)
references
References 25 publications
2
16
0
Order By: Relevance
“…In [4], it was shown that every ordinal less than ω ω ω is the order type of a deterministic context-free linear ordering and it was conjectured that a well-ordering is isomorphic to a context-free linear ordering if and only if its order type is less than ω ω ω . This conjecture was confirmed in [5] for deterministic context-free linear orderings, and in [18] for context-free linear orderings. Moreover, it was shown in [6] and [18] that the FC-rank of every scattered deterministic context-free linear ordering and in fact every scattered context-free linear ordering is less than ω ω .…”
Section: Introductionsupporting
confidence: 61%
See 2 more Smart Citations
“…In [4], it was shown that every ordinal less than ω ω ω is the order type of a deterministic context-free linear ordering and it was conjectured that a well-ordering is isomorphic to a context-free linear ordering if and only if its order type is less than ω ω ω . This conjecture was confirmed in [5] for deterministic context-free linear orderings, and in [18] for context-free linear orderings. Moreover, it was shown in [6] and [18] that the FC-rank of every scattered deterministic context-free linear ordering and in fact every scattered context-free linear ordering is less than ω ω .…”
Section: Introductionsupporting
confidence: 61%
“…This conjecture was confirmed in [5] for deterministic context-free linear orderings, and in [18] for context-free linear orderings. Moreover, it was shown in [6] and [18] that the FC-rank of every scattered deterministic context-free linear ordering and in fact every scattered context-free linear ordering is less than ω ω . Since the FC-rank of a well-ordering is less than ω ω exactly when its order type is less than ω ω ω , it follows in conjunction with results proved in [4] that a well-ordering is isomorphic to the lexicographic ordering of a context-free language or deterministic context-free language if and only if its order type is less than ω ω ω .…”
Section: Introductionsupporting
confidence: 61%
See 1 more Smart Citation
“…It is known, (see e.g. [15], proof of Proposition 1, paragraph 4) that in this case maxNodes(t) is the union of finitely many maximal paths. Clearly, the set {π 1 , .…”
Section: Muller Context-free Languages Of Scattered Wordsmentioning
confidence: 99%
“…Regular words were later studied in [4,6,7,32,40] and more recently in [35]. Context-free words were introduced in [8] and their underlying linear orderings were investigated in [9,10,14,15,[22][23][24].…”
Section: Introductionmentioning
confidence: 99%