Decidability of whether a context-free ordering has rank at most one and effective computability of its order type when the answer is yes.
Pure and Applied Math ematics, Elsevier Science (1982), https://books.google.hu/books?id=y3YpdW-sbFsC
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The order type of scattered context-free orderings of rank one is computable
Decidability of whether a context-free ordering has rank at most one and effective computability of its order type when the answer is yes.