7 citations · 16 across the 10 of their papers we have counts for
4 papers · 1 filter
The field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic
Alexander Kartzow
Recently, Schlicht and Stephan lifted the notion of automatic-structures to the notion of (finite-word) ordinal-automatic structures. These are structures whose domain and relation…
Reachability in Higher-Order-Counters
Alexander Heußner, Alexander Kartzow
Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automat…
Structures Without Scattered-Automatic Presentation
Alexander Kartzow, Philipp Schlicht
Bruyere and Carton lifted the notion of finite automata reading infinite words to finite automata reading words with shape an arbitrary linear order L. Automata on finite words can…
Strictness of the Collapsible Pushdown Hierarchy
Alexander Kartzow, Paweł Parys
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author's pumping lemma for higher-order pushdown graphs (without coll…