- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Saarbrücken, Universität des Saarlandes, Dissertation, 2016
- Classification
-
Informatik
- Keyword
-
Markov-Modell ; Markov-Prozess ; Stochastischer Automat ; Fehleranalyse ; Volterra-Integralgleichung
- Event
-
Veröffentlichung
- (where)
-
Saarbrücken
- (who)
-
Saarländische Universitäts- und Landesbibliothek
- (when)
-
2017
- Creator
-
Hatefi Ardakani, Hassan
- Contributor
-
Hermanns, Holger
- URN
-
urn:nbn:de:bsz:291-scidok-67438
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:50 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Hatefi Ardakani, Hassan
- Hermanns, Holger
- Saarländische Universitäts- und Landesbibliothek
Time of origin
- 2017
Other Objects (12)
Towards efficient analysis of Markov automata
Principles of Markov automata
Self-Assembling Finite Automata
Finite Markov chains
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Randomization in Non-Uniform Finite Automata
Finite automata and application to cryptography
Weighted Finite Automata over Strong Bimonoids
Minimizing finite automata is computationally hard
Modern aspects of classical automata theory : finite automata, biautomata, and lossy compression
Towards efficient analysis of Markov automata
Principles of Markov automata
Self-Assembling Finite Automata
Finite Markov chains
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Randomization in Non-Uniform Finite Automata
Finite automata and application to cryptography
Weighted Finite Automata over Strong Bimonoids
Minimizing finite automata is computationally hard
Modern aspects of classical automata theory : finite automata, biautomata, and lossy compression
Towards efficient analysis of Markov automata
Principles of Markov automata
Self-Assembling Finite Automata
Finite Markov chains
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Randomization in Non-Uniform Finite Automata
Finite automata and application to cryptography
Weighted Finite Automata over Strong Bimonoids
Minimizing finite automata is computationally hard