Hochschulschrift
On the descriptional and algorithmic complexity of regular languages
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783938363621
- Dimensions
-
21 cm
- Extent
-
XV, 174 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Zugl.: Gießen, Univ., Diss., 2009
- Keyword
-
Endlicher Automat
Reguläre Sprache
Berechnungskomplexität
- Event
-
Veröffentlichung
- (where)
-
Lichtenberg (Odw.)
- (who)
-
Harland Media
- (when)
-
2010
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:23 PM CEST
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
- Gruber, Hermann
- Harland Media
Time of origin
- 2010
Other Objects (12)
Nondeterministic Descriptional Complexity of Regular Languages
On fuzzy multiset regular languages
Symposium on semantics of algorithmic languages
Complexity results and the growths of hairpin completions of regular languages
Algorithmic learning of recursive languages
MEASURE OF REGULAR LANGUAGES
Regular Languages of Thin Trees
Temporal propositions as regular languages
Syntactic Complexity of Regular Ideals
Formal tree languages and their algorithmic learnability
OPTIMAL SUPERVISORY CONTROL OF REGULAR LANGUAGES
Algorithmic and computational complexity issues of MONET
Nondeterministic Descriptional Complexity of Regular Languages
On fuzzy multiset regular languages
Symposium on semantics of algorithmic languages
Complexity results and the growths of hairpin completions of regular languages
Algorithmic learning of recursive languages
MEASURE OF REGULAR LANGUAGES
Regular Languages of Thin Trees
Temporal propositions as regular languages
Syntactic Complexity of Regular Ideals
Formal tree languages and their algorithmic learnability
OPTIMAL SUPERVISORY CONTROL OF REGULAR LANGUAGES
Algorithmic and computational complexity issues of MONET
Nondeterministic Descriptional Complexity of Regular Languages
On fuzzy multiset regular languages
Symposium on semantics of algorithmic languages
Complexity results and the growths of hairpin completions of regular languages
Algorithmic learning of recursive languages
MEASURE OF REGULAR LANGUAGES
Regular Languages of Thin Trees
Temporal propositions as regular languages
Syntactic Complexity of Regular Ideals
Formal tree languages and their algorithmic learnability
OPTIMAL SUPERVISORY CONTROL OF REGULAR LANGUAGES