- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Stuttgart, Universität Stuttgart, Dissertation, 2019
- Schlagwort
-
Semigroups
Language and languages
Machine theory
Algorithms
- Ereignis
-
Veröffentlichung
- (wo)
-
Stuttgart
- (wer)
-
Universitätsbibliothek der Universität Stuttgart
- (wann)
-
2019
- Urheber
- Beteiligte Personen und Organisationen
-
Diekert, Volker
- DOI
-
10.18419/opus-10339
- URN
-
urn:nbn:de:bsz:93-opus-ds-103568
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:01 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Fleischer, Lukas
- Diekert, Volker
- Universitätsbibliothek der Universität Stuttgart
Entstanden
- 2019
Ähnliche Objekte (12)
Verifying probabilistic systems : new algorithms and complexity results
Classification and enumeration of finite semigroups
DLP in semigroups: Algorithms and lower bounds
Optimal harmonic period assignment: complexity results and approximation algorithms
Restrictions on local embeddability into finite semigroups
Finite representability of semigroups with demonic refinement
Optimal algorithms for binomial ideals and commutative semigroups
Optimal algorithms for binomial ideals and commutative semigroups
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Complexity results and practical algorithms for logics in knowledge representation
Ranks of finite semigroups of one-dimensional cellular automata
Verifying probabilistic systems : new algorithms and complexity results
Classification and enumeration of finite semigroups
DLP in semigroups: Algorithms and lower bounds
Optimal harmonic period assignment: complexity results and approximation algorithms
Restrictions on local embeddability into finite semigroups
Finite representability of semigroups with demonic refinement
Optimal algorithms for binomial ideals and commutative semigroups
Optimal algorithms for binomial ideals and commutative semigroups
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Complexity results and practical algorithms for logics in knowledge representation
Ranks of finite semigroups of one-dimensional cellular automata
Verifying probabilistic systems : new algorithms and complexity results
Classification and enumeration of finite semigroups
DLP in semigroups: Algorithms and lower bounds
Optimal harmonic period assignment: complexity results and approximation algorithms
Restrictions on local embeddability into finite semigroups
Finite representability of semigroups with demonic refinement
Optimal algorithms for binomial ideals and commutative semigroups
Optimal algorithms for binomial ideals and commutative semigroups
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Complexity results and practical algorithms for logics in knowledge representation