On the Order Type of Scattered Context-Free Orderings
Formal Languages and Automata Theory
2019-09-19 v1
Abstract
We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than , then its order type is effectively computable.
Cite
@article{arxiv.1909.08543,
title = {On the Order Type of Scattered Context-Free Orderings},
author = {Kitti Gelle and Szabolcs Iván},
journal= {arXiv preprint arXiv:1909.08543},
year = {2019}
}
Comments
In Proceedings GandALF 2019, arXiv:1909.05979. arXiv admin note: text overlap with arXiv:1907.11573