Results 1  10
of
144
Connections Among SpaceBounded and Multihead Probabilistic Automata
, 1994
"... We show that the heads of multihead unboundederror or boundederror or onesidederror probabilistic finite automata are equivalent alternatives to the storage tapes of the corresponding probabilistic Turing machines (Theorem 1). These results parallel the classic ones concerning deterministic and n ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that the heads of multihead unboundederror or boundederror or onesidederror probabilistic finite automata are equivalent alternatives to the storage tapes of the corresponding probabilistic Turing machines (Theorem 1). These results parallel the classic ones concerning deterministic
RealTime Deques, Multihead Turing Machines, and Purely Functional Programming
 In Conference on Functional Programming Languages and Computer Architecture
, 1993
"... We answer the following question: Can a deque (double ended queue) be implemented in a purely functional language such that each push or pop operation on either end of a queue is accomplished in O(1) time in the worst case? The answer is yes, thus solving a problem posted by Gajewska and Tarjan [1 ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
, and can be used to give a realtime simulation of a multihead Turing machine in a purel...
Properties of Multihead TwoWay Probabilistic Finite Automata
, 1994
"... We present properties of multihead twoway probabilistic finite automata that parallel those of their deterministic and nondeterministic counterparts. We define multihead probabilistic finite automata with logspace constructible transition probabilities, and we describe a simple technique to simula ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
to simulate these automata by standard logspace probabilistic Turing machines. Next, we represent logspace probabilistic complexity classes as proper hierarchies based on corresponding multihead twoway probabilistic finite automata, and we show their (deterministic logspace) reducibility to the second
Power of Cooperation and Multihead Finite Systems ⋆
"... Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other heads, but the automata cooperate in making state transitions. Computational power of such devices depends on the number of ..."
Abstract
 Add to MetaCart
of states of automata, the number of automata, and the way they cooperate. We concentrate our attention on the last issue. The first situation that we consider is that each automaton has a full knowledge on the states of all automata (multihead automata). The other extreme is that each automaton (called
Properties of Probabilistic Pushdown Automata
 Theoretical Computer Science
, 1994
"... Properties of probabilistic as well as "probabilistic plus nondeterministic" pushdown automata and auxiliary pushdown automata are studied. These models are analogous to their counterparts with nondeterministic and alternating states. Complete characterizations in terms of wellknown compl ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
known complexity classes are given for the classes of languages recognized by polynomial timebounded, logarithmic spacebounded auxiliary pushdown automata with probabilistic states and with "probabilistic plus nondeterministic" states. Also, complexity lower bounds are given for the classes
Automata with Nested Pebbles Capture FirstOrder Logic with Transitive Closure
"... The special case of k = 1 for trees, shows that singlehead deterministic treewalking automata with nested pebbles are characterized by firstorder logic with unary deterministic transitive closure. This refines our earlier result that placed these automata between firstorder and secondorder logic ..."
Abstract
 Add to MetaCart
order logic on trees. 1 Introduction The complexity class DSPACE(log n) of string languages accepted in logarithmic space by deterministic Turing machines, has two distinct characterizations. The first one, folklore (see [24]), is in terms of deterministic twoway automata with several heads working
Logic and the Challenge of Computer Science
, 1988
"... Nowadays computer science is surpassing mathematics as the primary field of logic applications, but logic is not tuned properly to the new role. In particular, classical logic is preoccupied mostly with infinite static structures whereas many objects of interest in computer science are dynamic objec ..."
Abstract

Cited by 165 (16 self)
 Add to MetaCart
objects with bounded resources. This chapter consists of two independent parts. The first part is devoted to finite model theory; it is mostly a survey of logics tailored for computational complexity. The second part is devoted to dynamic structures with bounded resources. In particular, we use dynamic
Finite Presentations of Infinite Structures: Automata and Interpretations
 Theory of Computing Systems
, 2002
"... We study definability problems and algorithmic issues for infinite structures that are finitely presented. After a brief overview over different classes of finitely presentable structures, we focus on structures presented by automata or by modeltheoretic interpretations. ..."
Abstract

Cited by 54 (4 self)
 Add to MetaCart
We study definability problems and algorithmic issues for infinite structures that are finitely presented. After a brief overview over different classes of finitely presentable structures, we focus on structures presented by automata or by modeltheoretic interpretations.
On the Structure of LogSpace Probabilistic Complexity Classes
, 1994
"... We investigate hierarchical properties and logspace reductions of languages recognized by logspace probabilistic Turing machines, ArthurMerlin games and Games against Nature with logspace probabilistic verifiers. For each logspace complexity class, we decompose it into a hierarchy based on corr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate hierarchical properties and logspace reductions of languages recognized by logspace probabilistic Turing machines, ArthurMerlin games and Games against Nature with logspace probabilistic verifiers. For each logspace complexity class, we decompose it into a hierarchy based
Linear Logic and Subpolynomial Classes of Complexity
, 2013
"... This research in Theoretical Computer Science extends the gateways between Linear Logic and Complexity Theory by introducing two innovative models of computation. It focuses on subpolynomial classes of complexity: AC and NC the classes of efficiently parallelizable problems and L and NL the d ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
wander on simple structures using pointers, parsing them without modifying themWe make this intuition formal by introducing Non Deterministic Pointer Machines and relating them to other wellknown pointerlikemachines. We obtain by doing so new implicit characterizations of subpolynomial classes
Results 1  10
of
144