7 citations · 16 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
Satisfiability of CTL* with constraints
Claudia Carapelle, Alexander Kartzow, Markus Lohrey
We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g.…
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…
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
Alexander Kartzow
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constra…