Relevant bibliographies by topics / Gewichteter Automat

Contents

  1. Dissertations / Theses
  2. Books

Academic literature on the topic 'Gewichteter Automat'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Gewichteter Automat.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Dissertations / Theses on the topic "Gewichteter Automat"

1

Mathissen, Christian. "Weighted automata and weighted logics over tree-like structures." München Verl. Dr. Hut, 2009. http://d-nb.info/99772336X/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Quaas, Karin. "Kleene-Schützenberger and Büchi Theorems for Weighted Timed Automata." Doctoral thesis, Universitätsbibliothek Leipzig, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-38791.

Full text
Abstract:
In 1994, Alur and Dill introduced timed automata as a simple mathematical model for modelling the behaviour of real-time systems. In this thesis, we extend timed automata with weights. More detailed, we equip both the states and transitions of a timed automaton with weights taken from an appropriate mathematical structure. The weight of a transition determines the weight for taking this transition, and the weight of a state determines the weight for letting time elapse in this state. Since the weight for staying in a state depends on time, this model, called weighted timed automata, has many i
APA, Harvard, Vancouver, ISO, and other styles
3

Götze, Doreen. "Weighted Unranked Tree Automata over Tree Valuation Monoids." Doctoral thesis, Universitätsbibliothek Leipzig, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-221154.

Full text
Abstract:
Quantitative aspects of systems, like the maximal consumption of resources, can be modeled by weighted automata. The usual approach is to weight transitions with elements of a semiring and to define the behavior of the weighted automaton by mul- tiplying the transition weights along a run. In this thesis, we define and investigate a new class of weighted automata over unranked trees which are defined over valuation monoids. By turning to valuation monoids we use a more general cost model: the weight of a run is now determined by a global valuation function. Besides the binary cost functions im
APA, Harvard, Vancouver, ISO, and other styles
4

Perevoshchikov, Vitaly. "Multi-weighted Automata Models and Quantitative Logics." Doctoral thesis, Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-166142.

Full text
Abstract:
Recently, multi-priced timed automata have received much attention for real-time systems. These automata extend priced timed automata by featuring several price parameters. This permits to compute objectives like the optimal ratio between rewards and costs. Arising from the model of timed automata, the multi-weighted setting has also attracted much notice for classical nondeterministic automata. The present thesis develops multi-weighted MSO-logics on finite, infinite and timed words which are expressively equivalent to multi-weighted automata, and studies decision problems for them. In addi
APA, Harvard, Vancouver, ISO, and other styles
5

Pech, Christian. "Kleene-Type Results for Weighted Tree-Automata." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2004. http://nbn-resolving.de/urn:nbn:de:swb:14-1083663461937-32692.

Full text
Abstract:
The main result of this thesis is the generalization of the Kleene-theorem to formal tree-series over commutative semirings (the Kleene theorem states the coincidence between rational and recognizable formal languages). To this end weighted tree-languages are introduced and the Kleene-theorem is proved for them. The desired result for formal tree-series is then obtained through application of a homomorphism that relates weighted tree-languages with formal tree-series. In the second part of the thesis the connections to the theorie of Iteration-theories are discovered. In particular it is shown
APA, Harvard, Vancouver, ISO, and other styles
6

Pech, Christian. "Kleene-Type Results for Weighted Tree-Automata." Doctoral thesis, Technische Universität Dresden, 2003. https://tud.qucosa.de/id/qucosa%3A24335.

Full text
Abstract:
The main result of this thesis is the generalization of the Kleene-theorem to formal tree-series over commutative semirings (the Kleene theorem states the coincidence between rational and recognizable formal languages). To this end weighted tree-languages are introduced and the Kleene-theorem is proved for them. The desired result for formal tree-series is then obtained through application of a homomorphism that relates weighted tree-languages with formal tree-series. In the second part of the thesis the connections to the theorie of Iteration-theories are discovered. In particular it is shown
APA, Harvard, Vancouver, ISO, and other styles
7

Büchse, Matthias. "Algebraic decoder specification: coupling formal-language theory and statistical machine translation." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-159266.

Full text
Abstract:
The specification of a decoder, i.e., a program that translates sentences from one natural language into another, is an intricate process, driven by the application and lacking a canonical methodology. The practical nature of decoder development inhibits the transfer of knowledge between theory and application, which is unfortunate because many contemporary decoders are in fact related to formal-language theory. This thesis proposes an algebraic framework where a decoder is specified by an expression built from a fixed set of operations. As yet, this framework accommodates contemporary syntax-
APA, Harvard, Vancouver, ISO, and other styles
8

Herrmann, Luisa. "Weighted Automata with Storage." 2020. https://tud.qucosa.de/id/qucosa%3A74068.

Full text
Abstract:
In this thesis, we investigate weighted tree automata with storage theoretically. This model generalises finite state automata in three dimensions: (i) from words to trees, (ii) by using an arbitrary storage type in addition to a finite-state control, and (iii) by considering languages in a quantitative setting using a weight structure.
APA, Harvard, Vancouver, ISO, and other styles
9

Quaas, Karin. "Kleene-Schützenberger and Büchi Theorems for Weighted Timed Automata." Doctoral thesis, 2009. https://ul.qucosa.de/id/qucosa%3A11034.

Full text
Abstract:
In 1994, Alur and Dill introduced timed automata as a simple mathematical model for modelling the behaviour of real-time systems. In this thesis, we extend timed automata with weights. More detailed, we equip both the states and transitions of a timed automaton with weights taken from an appropriate mathematical structure. The weight of a transition determines the weight for taking this transition, and the weight of a state determines the weight for letting time elapse in this state. Since the weight for staying in a state depends on time, this model, called weighted timed automata, has many i
APA, Harvard, Vancouver, ISO, and other styles
10

Götze, Doreen. "Weighted Unranked Tree Automata over Tree Valuation Monoids." Doctoral thesis, 2016. https://ul.qucosa.de/id/qucosa%3A15442.

Full text
Abstract:
Quantitative aspects of systems, like the maximal consumption of resources, can be modeled by weighted automata. The usual approach is to weight transitions with elements of a semiring and to define the behavior of the weighted automaton by mul- tiplying the transition weights along a run. In this thesis, we define and investigate a new class of weighted automata over unranked trees which are defined over valuation monoids. By turning to valuation monoids we use a more general cost model: the weight of a run is now determined by a global valuation function. Besides the binary cost functions im
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Gewichteter Automat"

1

Kuich, Werner, Heiko Vogler, and Manfred Droste. Handbook of Weighted Automata. Springer London, Limited, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Handbook Of Weighted Automata. Springer, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography