- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Lübeck, Universität zu Lübeck, Dissertation, 2019
- Keyword
-
Sequential machine theory
- Event
-
Veröffentlichung
- (where)
-
Lübeck
- (who)
-
Zentrale Hochschulbibliothek Lübeck
- (when)
-
2020
- Creator
-
Lutter, Matthias
- Contributor
-
Reischuk, Rüdiger
Simon, Hans
- URN
-
urn:nbn:de:gbv:841-2020041546
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.20242024, 12:40 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.
Associated
- Lutter, Matthias
- Reischuk, Rüdiger
- Simon, Hans
- Zentrale Hochschulbibliothek Lübeck
Time of origin
- 2020
Other Objects (12)
Self-Assembling Finite Automata
Foundations of active automata learning: an algorithmic perspective
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite horizon analysis of Markov automata
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
Finite-state genericity : on the diagonalization strength of finite automata
Self-Assembling Finite Automata
Foundations of active automata learning: an algorithmic perspective
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite horizon analysis of Markov automata
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
Finite-state genericity : on the diagonalization strength of finite automata
Self-Assembling Finite Automata
Foundations of active automata learning: an algorithmic perspective
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite horizon analysis of Markov automata
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