Searching for authors named "Manfred Droste" – sorted by Relevance.
-
Weighted automata and weighted logics
- Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour of such an automaton is a mapping, called a formal power series, assigning to each word a weight in some semiring. We g
- Cited by 8 (2 self) – Add To MetaCart
-
Recognizable and rational formal power series with general discounting
- We investigate the behaviours of weighted automata with general discounting; these are the skew (formal power) series. Recently, it was shown that the recognizable skew series are precisely the rational skew series [DK03]; this generalizes a classical result of Kleene-Schützenberger [Kle56, Sch61].
- Cited by 1 (1 self) – Add To MetaCart
-
A Kleene theorem for weighted tree automata
- In this paper we prove Kleene's result for tree series over a commutative and idempotent semiring A (which is not necessarily complete or continuous), i.e., the class of recognizable tree series over A and the class of rational tree series over A are equal. We show the result by direct automata-theo
- Cited by 12 (8 self) – Add To MetaCart
-
Weighted Automata with Discounting
- Abstract: We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted automata precisely as rational formal power series with a discounted form of the Cauchy product. This extends a
- Add To MetaCart
-
Asynchronous cellular automata for pomsets
- This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Cori, Métivier and Zielonka and we show how to const
- Cited by 16 (3 self) – Add To MetaCart
-
Representation of Computations in Concurrent Automata by Dependence Orders
- An automaton with concurrency relations A is a labeled transition system with a collection of binary relations indicating when two actions in a given state of the automaton can occur independently of each other. The concurrency relations induce a natural equivalence relation for finite computatio
- Cited by 7 (2 self) – Add To MetaCart
-
Logic and Algebra in Concurrency
- Point of View 15:40-16:10 R. Borgschulze (Dresden): Logical Denability of Recognizable Languages in Concurrent Automata Research Thursday, Sep 14 9:00-10:00 A. Petit (Cachan): Updatable timed automata 10:40-11:40 D. Therien (Montreal): The polynomial length property for programs Lunch 13:10-14:1
- Add To MetaCart
-
Set-Homogeneous Graphs and Embeddings of Total Orders
- Introduction This paper is in part a sequel to [5] and [4]. We construct a certain uncountable graph, thereby answering a question on automorphism groups of infinite graphs which was raised in [5]. The method of construction is order-theoretic, and uses ideas from [4]. We first build a certain unco
- Add To MetaCart
-
eingereicht von
- Doctor rerum naturalium (Dr. rer. nat.)
- Add To MetaCart

