Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Huschenbett, Martin"'
Autor:
Bernauer, Alexander, Faro, Sofia, Hämmerle, Rémy, Huschenbett, Martin, Kiefer, Moritz, Lochbihler, Andreas, Mäki, Jussi, Mazzoli, Francesco, Meier, Simon, Mitchell, Neil, Veprek, Ratko G.
Distributed ledger technologies, also known as blockchains for enterprises, promise to significantly reduce the high cost of automating multi-party business workflows. We argue that a programming language for writing such on-ledger logic should satis
Externí odkaz:
http://arxiv.org/abs/2303.03749
Autor:
Huschenbett, Martin
We investigate weighted asynchronous cellular automata with weights in valuation monoids. These automata form a distributed extension of weighted finite automata and allow us to model concurrency. Valuation monoids are abstract weight structures that
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A17230
https://ul.qucosa.de/api/qucosa%3A17230/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A17230/attachment/ATT-0/
Autor:
Huschenbett, Martin
Der Inhalt dieser Arbeit sind jedoch nicht Quantencomputer im Allgemeinen, sondern hauptsächlich Quantenautomaten. Dies führt zu den Begriffen der „endlichen Quantenautomaten“ und der „quantenregulären“ oder „quantenerkennbaren Sprachen
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A17152
https://ul.qucosa.de/api/qucosa%3A17152/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A17152/attachment/ATT-0/
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 terminating semi-Thue system and study some of its basic algebraic properti
Externí odkaz:
http://arxiv.org/abs/1404.5479
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 question whether a given regular language is definable in a particula
Externí odkaz:
http://arxiv.org/abs/1310.3195
Autor:
Huschenbett, Martin
We generalise Delhomm\'e's result that each tree-automatic ordinal is strictly below \omega^\omega^\omega{} by showing that any tree-automatic linear ordering has FC-rank strictly below \omega^\omega. We further investigate a restricted form of tree-
Externí odkaz:
http://arxiv.org/abs/1204.3048
Publikováno v:
Logical Methods in Computer Science, Volume 9, Issue 2 (June 25, 2013) lmcs:721
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 to
Externí odkaz:
http://arxiv.org/abs/1201.5495
Autor:
Huschenbett, Martin
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 trees synchronously. Words can be regarded as specific simple trees an
Externí odkaz:
http://arxiv.org/abs/1201.5070
Autor:
Huschenbett, Martin1, Kuske, Dietrich2 dietrich.kuske@tu-ilmenau.de, Zetzsche, Georg3 zetzsche@lsv.fr
Publikováno v:
Semigroup Forum. Dec2017, Vol. 95 Issue 3, p475-508. 34p.
Autor:
Huschenbett, Martin1 martin.huschenbett@ifi.lmu.de, Kartzow, Alexander2 kartzow@eti.uni-siegen.de, Schlicht, Philipp3 schlicht@math.uni-bonn.de
Publikováno v:
Computability. 2017, Vol. 6 Issue 2, p125-164. 40p.