Results 1  10
of
88,190
THE DOTDEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
 INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
"... It is wellknown that the Σk and Πklevels of the dotdepth hierarchy and the polynomial hierarchy correspond via leaf languages. We extend this correspondence to the ∆klevels of these hierarchies: LeafP (∆L k) = ∆p k. The same methods are used to give evidence against an earlier conjecture of S ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
It is wellknown that the Σk and Πklevels of the dotdepth hierarchy and the polynomial hierarchy correspond via leaf languages. We extend this correspondence to the ∆klevels of these hierarchies: LeafP (∆L k) = ∆p k. The same methods are used to give evidence against an earlier conjecture
ISSN 09463852The DotDepth and the Polynomial Hierarchy Correspond on the Delta Levels
"... Abstract. It is wellknown that the Σk and Πklevels of the dotdepth hierarchy and the polynomial hierarchy correspond via leaf languages. In this paper this correspondence will be extended to the ∆klevels of these hierarchies: Leaf P ( ∆ L k) = ∆ p k. 1 ..."
Abstract
 Add to MetaCart
Abstract. It is wellknown that the Σk and Πklevels of the dotdepth hierarchy and the polynomial hierarchy correspond via leaf languages. In this paper this correspondence will be extended to the ∆klevels of these hierarchies: Leaf P ( ∆ L k) = ∆ p k. 1
Boolean Hierarchies inside DotDepth One
, 1999
"... Let B 1/2 denote the class of languages having dotdepth 1=2, i.e., the class of languages that can we written as finite unions of languages u 0 A + u 1 A + \Delta \Delta \Delta un\Gamma1 A + un , where u i 2 A and n 0. A language has dotdepth one if and only if it is in the Boolean clo ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Let B 1/2 denote the class of languages having dotdepth 1=2, i.e., the class of languages that can we written as finite unions of languages u 0 A + u 1 A + \Delta \Delta \Delta un\Gamma1 A + un , where u i 2 A and n 0. A language has dotdepth one if and only if it is in the Boolean
Languages of DotDepth 3/2
 In Proceedings 17th Symposium on Theoretical Aspects of Computer Science
, 2000
"... . We prove an effective characterization of languages having dotdepth 3=2. Let B 3=2 denote this class, i.e., languages that can be written as finite unions of languages of the form u0L1u1L2u2 \Delta \Delta \Delta Lnun , where u i 2 A and L i are languages of dotdepth one. Let F be a determi ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
. We prove an effective characterization of languages having dotdepth 3=2. Let B 3=2 denote this class, i.e., languages that can be written as finite unions of languages of the form u0L1u1L2u2 \Delta \Delta \Delta Lnun , where u i 2 A and L i are languages of dotdepth one. Let F be a
The Boolean Hierarchy over DotDepth 1/2
, 1999
"... For some fixed alphabet A with jAj 2, a language L A + is in the class B 1=2 of the dotdepth hierachy if and only if it can be written as a finite union of languages u 0 A + u 1 A + u 2 A + un , where u i 2 A and n 0. Using an automatatheoretic approach, we show a membership cri ..."
Abstract
 Add to MetaCart
For some fixed alphabet A with jAj 2, a language L A + is in the class B 1=2 of the dotdepth hierachy if and only if it can be written as a finite union of languages u 0 A + u 1 A + u 2 A + un , where u i 2 A and n 0. Using an automatatheoretic approach, we show a membership
The Boolean Structure of DotDepth One
 Journal of Automata, Languages and Combinatorics
, 2000
"... By definition, the class B1 of dotdepth one languages is the Boolean closure of the class B 1=2 of languages that can be written as finite unions of u0A + u1 A + un , where u i 2 A . So dotdepth one languages can be described by Boolean combinations of patterns (u0 , u1 , ..., un ) in words which ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
By definition, the class B1 of dotdepth one languages is the Boolean closure of the class B 1=2 of languages that can be written as finite unions of u0A + u1 A + un , where u i 2 A . So dotdepth one languages can be described by Boolean combinations of patterns (u0 , u1 , ..., un ) in words which
Some Results on the DotDepth Hierarchy
, 1992
"... : In this paper we pursue the study of the decidability of the dotdepth hierarchy. We give an e#ective lower bound for the dotdepth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal'cev product. We also prove the ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
: In this paper we pursue the study of the decidability of the dotdepth hierarchy. We give an e#ective lower bound for the dotdepth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal'cev product. We also prove
SelfSimilarity Through HighVariability: Statistical Analysis of Ethernet LAN Traffic at the Source Level
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is selfsimilar or longrange dependent in nature (i.e., bursty over a wide range of time scales)  in sharp contrast to commonly made tr ..."
Abstract

Cited by 740 (24 self)
 Add to MetaCart
analyses of realtime traffic measurements from Ethernet LAN's at the level of individual sources. This paper is an extended version of [53] and differs from it in significant ways. In particular, we develop here the mathematical results concerning the superposition of strictly alternating ON
Hierarchical Models of Object Recognition in Cortex
, 1999
"... The classical model of visual processing in cortex is a hierarchy of increasingly sophisticated representations, extending in a natural way the model of simple to complex cells of Hubel and Wiesel. Somewhat surprisingly, little quantitative modeling has been done in the last 15 years to explore th ..."
Abstract

Cited by 817 (84 self)
 Add to MetaCart
The classical model of visual processing in cortex is a hierarchy of increasingly sophisticated representations, extending in a natural way the model of simple to complex cells of Hubel and Wiesel. Somewhat surprisingly, little quantitative modeling has been done in the last 15 years to explore
Results 1  10
of
88,190