activity
20122023
most citedTree-Automatic Well-Founded Trees

7 citations · 13 across the 4 of their papers we have counts for

collaborators

6 papers

cs.PL2023★ 3 cited

Daml: A Smart Contract Language for Securely Automating Real-World Multi-Party Business Workflows

Alexander Bernauer, Sofia Faro, Rémy Hämmerle +8

Distributed ledger technologies, also known as blockchains for enterprises, promise to significantly reduce the high cost of automating multi-party business workflows. We argue tha…

cs.FL2014

The monoid of queue actions

Martin Huschenbett, Dietrich Kuske, Georg Zetzsche

We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and termi…

cs.FL2013

Ehrenfeucht-Fraisse Games on Omega-Terms

Martin Huschenbett, Manfred Kufleitner

Fragments of first-order logic over words can often be characterized in terms of finite monoids or finite semigroups. Usually these algebraic descriptions yield decidability of the…

cs.LO2012★ 1 cited

The Rank of Tree-Automatic Linear Orderings

Martin Huschenbett

We generalise Delhommé's result that each tree-automatic ordinal is strictly below ω^ω^ω by showing that any tree-automatic linear ordering has FC-rank strictly below ω^ω. We furth…

cs.LO2012★ 2 cited

Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable

Martin Huschenbett

A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of…

cs.LO2012★ 7 cited

Tree-Automatic Well-Founded Trees

Martin Huschenbett, Alexander Kartzow, Jiamou Liu +1

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-f…