Browsing FB 07  Mathematik und Informatik, Physik, Geographie by Issue Date
Now showing items 120 of 88

Parallele Automaten
(1994) 
On stackaugmented polyautomata
(1995)A stack augmented generalization of cellular automata, the pushdown cellular automata, are investigated. We are studying the language accepting capabilities of such devices. Closure properties of realtime, lineartime and ... 
On time computability of functions in oneway cellular automata
(1995)The capability of oneway (spacebounded) cellular automata (OCA) to timecompute functions is investigated. That means given an constant input of length n a distinguished cell has to enter a distinguished state exactly ... 
On the power of oneway bounded cellular time computers
(1996)Comparisons of different cellular devices and the investigation of their computing power can be made in terms of their capabilities to timeconstruct and timecompute functions. Timeconstruction means that a distinguished ... 
Some relations between massively parallel arrays
(1996)Relations between various models for massively parallel computers are investigated. These are arrays of finitestate machines  eventually augmented by pushdown storage  operating synchronously. The architectures differ ... 
Existential secondorder logic over strings
(1997)Existential secondorder logic (ESO) and monadic secondorder logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over word structures than MSO. However, little was ... 
Enhancing symbolic model checking by AI techniques
(1997)Comparisons of different cellular devices and the investigation of their computing power can be made in terms of their capabilities to timeconstruct and timecompute functions. Timeconstruction means that a distinguished ... 
Räumliche Konzentration der VerpackungsmaschinenbauIndustrie in Mittelhessen : Eine Analyse des Gründungsgeschehens
(1998)Stellt man die Standorte der VerpackungsmaschinenbauBetriebe in Deutschland1 dar, so fällt auf, daß sich die Betriebe nicht gleichmäßig verteilen, sondern auf wenige Schwerpunktregionen konzentrieren (vgl. Abb. 1). Die ... 
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 ... 
On interacting automata with limited nondeterminism
(1998)Oneway and twoway cellular language acceptors with restricted non determinism are investigated. The number of nondeterministic state transitions is regarded as limited resource which depends on the length of the input. ... 
Probalistic and truthfunctional manyvalued logic programming
(1998)We introduce probabilistic manyvalued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic manyvalued logic programming is computationally more complex ... 
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 ... 
On time reduction and simulation in cellular spaces
(1998)We prove a generalized and corrected version of the time reduction theorem for cellular spaces. One basic tool for investigations in this field is the concept of simulation between systems of automata. We propose a general ... 
One guess oneway cellular arrays
(1998)Oneway cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a limit to exactly one step does not decrease ... 
A firstorder 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 ... 
Heterogeneous active agents
(1998)Over the years, many different agent programming languages have been proposed. In this paper, we propose a concept called Agent Programs using which, the way an agent should act in various situations can be declaratively ... 
Preferred answer sets for extended logic programs
(1998)In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules ... 
On tally languages and generalized interacting automata
(1999)Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the wellknown result that each tally language acceptable by a classical oneway cellular ...