302 research outputs found
Scattered one-counter languges have rank less than
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 (, resp).
In this paper we confirm the conjecture that one-counter languages have rank
less than
On the Order Type of Scattered Context-Free Orderings
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.Comment: In Proceedings GandALF 2019, arXiv:1909.05979. arXiv admin note: text
overlap with arXiv:1907.1157
Isomorphism relations on computable structures
"Vegeu el resum a l'inici del document del fitxer adjunt"
Regular expressions for muller context-free languages
Muller context-free languages (MCFLs) are languages of countable words, that is, labeled countable linear orders, generated by Muller context-free grammars. Equivalently, they are the frontier languages of (nondeterministic Muller-)regular languages of infinite trees. In this article we survey the known results regarding MCFLs, and show that a language is an MCFL if and only if it can be generated by a so-called µη-regular expression
Tree-Automatic Well-Founded Trees
We investigate tree-automatic well-founded trees. Using Delhomme's
decomposition technique for tree-automatic structures, we show that the
(ordinal) rank of a tree-automatic well-founded tree is strictly below
omega^omega. Moreover, we make a step towards proving that the ranks of
tree-automatic well-founded partial orders are bounded by omega^omega^omega: we
prove this bound for what we call upwards linear partial orders. As an
application of our result, we show that the isomorphism problem for
tree-automatic well-founded trees is complete for level Delta^0_{omega^omega}
of the hyperarithmetical hierarchy with respect to Turing-reductions.Comment: Will appear in Logical Methods of Computer Scienc
- …