2 citations · 3 across the 6 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.FL2019★ 1 cited
On the Order Type of Scattered Context-Free Orderings
Kitti Gelle, Szabolcs Iván
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.
cs.FL2019
The order type of scattered context-free orderings of rank one is computable
Kitti Gelle, Szabolcs Ivan
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 or…