Auflistung JLUdocs nach DDC-Klassifikation "ddc:004"
Anzeige der Dokumente 1-20 von 115
-
1. eLearning- und Medientag am 26. April 2005 an der JLU Gießen
(2005)Das eLearning- und Medien-Netzwerk der JLU Gießen elemenTs veranstaltet am 26. April 2005 den ersten eLearning- & Medien-Tag an der JLU Gießen. Im Hauptgebäude der JLU Gießen werden von 9.00 bis 16.30 Uhr eLearning- und ... -
18. Theorietag "Automaten und Formale Sprachen" : Wettenberg-Launsbach bei Gießen 30. September - 2. Oktober 2008
(2008)Der Theorietag ist die Jahrestagung der Fachgruppe Automaten und Formale Sprachen der Gesellschaft für Informatik. Er wird seit 1991 von Mitgliedern der Fachgruppe an wechselnden Orten in Deutschland und Österreich ... -
A first-order representation of stable models
(1998)Turi (1991) introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a constrained interpretation. We investigate ... -
A sentiment analysis of Spanish and Italian news articles about COVID-19: Exploring the emotional reaction on government-applied restrictions
(2021)In 2020 the effects of the COVID-19 pandemic and the related government-applied nationwide measures deeply influenced the Italian and Spanish population, not only financially and socially, but also in terms of the emotional ... -
Application of machine learning for the prediction of stable isotopes of water concentrations in streams and groundwater
(2021-09-03)This dissertation introduces the application of machine learning to isotope hydrology. The recent development of laser spectroscopy has made it feasible to measure stable isotopes of water in high temporal resolutions up ... -
Automata arrays and context-free languages
(1999)From a biological point of view automata arrays have been employed by John von Neumann in order to solve the logical problem of nontrivial self-reproduction. From a computer scientific point of view they are a model for ... -
Below linear-time : Dimensions versus time
(2000)Deterministic d-dimensional Turing machines are considered. We investigate the classes of languages acceptable by such devices with time bounds of the form id + r where r E o(id) is a sublinear function. It is shown that ... -
Die Berechnungsstärke von Forgetting-Automaten
(2008)Die sogenannten Forgetting-Automaten wurdeneingeführt, um bestimmte Methoden aus derLinguistik zu modellieren. Formal werden sie alsAutomaten definiert, die eine oder mehrere derOperationen MVL und MVR (Bewegung des Kopfes ... -
Beschreibungskomplexität von Restart-Automaten
(2007)Das Modell der Restart-Automaten gibt es seit etwa 15 Jahren. Durch die Ausstattung mit verschiedenen Berechnungsressourcen und die Auferlegung von Einschränkungen an die Arbeitsweise entstand mit der Zeit ein unfangreiches ... -
Biologically inspired computer models of the microscopic and macroscopic structure of the brain based on wiring optimisation
(2022)Like all natural systems, the mammalian brain and its neurons are governed by the fundamental principles of physics. Simplified computer simulations based on such principles help us see through the high complexity of ... -
Cellular automata with sparse communication
(2009)We investigate cellular automata whose internal inter-cell communication is bounded. The communication is quantitatively measured by the number of uses of the links between cells. Bounds on the sum of all communications ... -
Comments on Monoids Induced by NFAs
(2023-03)We summarize known results on the transformation monoid of nondeterministic finite automata (NFAs) from semigroup theory. In particular, we list what is known from the literature on the size of monoids induced by NFAs and ... -
Computing intersections of Horn theories for reasoning with models
(1998)Modelbased reasoning has been proposed as an alternative form of representing and accessing logical knowledge bases. In this approach, a knowledge base is represented by a set of characteristic models. In this paper, we ... -
Decision lists and related Boolean functions
(1998)We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1decision lists has interesting relationships to ... -
Descriptional complexity of pushdown store languages
(2012)It is well known that the pushdown store language P(M) of a pushdown automaton (PDA) M i.e., the language consisting of words occurring on the pushdownalong accepting computations of M is a regular language. Here, we ...