Results 1  10
of
1,672,983
On Defect Effect of Biinfinite Words
 In MFCS'98
, 1998
"... We prove the following two variants of the defect theorem. Let X be a finite set of words over a finite alphabet. Then if a nonperiodic biinfinite word w has two Xfactorizations, then the combinatorial rank of X is at most card(X) \Gamma 1, i.e. there exists a set F such that X ` F ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
We prove the following two variants of the defect theorem. Let X be a finite set of words over a finite alphabet. Then if a nonperiodic biinfinite word w has two Xfactorizations, then the combinatorial rank of X is at most card(X) \Gamma 1, i.e. there exists a set F such that X ` F
Spectral factorization of biinfinite multiindex block Toeplitz matrices
, 2002
"... In this paper we formulate a theory of LU and Cholesky factorization of biinfinite block Toeplitz matrices A = (Ai−j) i,j∈Z d indexed by i, j ∈ Z d and develop two numerical ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In this paper we formulate a theory of LU and Cholesky factorization of biinfinite block Toeplitz matrices A = (Ai−j) i,j∈Z d indexed by i, j ∈ Z d and develop two numerical
A Characterization of Periodicity of Biinfinite Words
, 2003
"... A finite word is called bordered if it has a proper prefix which is also a suffix of that word. Costa proves in (Theoret. Comput. Sci., 290(3):2053–2061, 2003) that a biinfinite word w is of the form ω fgf ω, for some finite words f and g, if, and only if, there is a factorization w = suv, with u ∈ ..."
Abstract
 Add to MetaCart
A finite word is called bordered if it has a proper prefix which is also a suffix of that word. Costa proves in (Theoret. Comput. Sci., 290(3):2053–2061, 2003) that a biinfinite word w is of the form ω fgf ω, for some finite words f and g, if, and only if, there is a factorization w = suv, with u
Benchmarking model and satisfiabilitychecking on biinfinite time
 In ICTAC 2008
, 2008
"... Abstract. Model checking techniques traditionally deal with temporal logic languages and automata interpreted over ωwords, i.e., where time is infinite in the future but finite in the past. This is motivated by the study of reactive systems, which are typically nonterminating: system termination m ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of operations (such as configuration or installation) typically performed at system deployment time. In this paper, we investigate the feasibility of bounded model checking and bounded satisfiability checking when dealing with biinfinite automata and logics. We present a tool and we discuss its application
Defect Effect of Biinfinite Words in the Twoelement Case
, 2000
"... Let X be a twoelement set of words over a finite alphabet. If a biinfinite word possesses two Xfactorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates. Note, that this is a strict sharpening of a defect theorem for biinfinite words stated in [KMP2] ..."
Abstract
 Add to MetaCart
Let X be a twoelement set of words over a finite alphabet. If a biinfinite word possesses two Xfactorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates. Note, that this is a strict sharpening of a defect theorem for biinfinite words stated in [KMP2
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
On the invertibility of “rectangular” biinfinite matrices and applications in time–frequency analysis
, 2007
"... ..."
Consider the Toda lattice ∂L ∂tn on biinfinite tridiagonal matrices
, 2008
"... = [(L n)+, L] = [−(L n)−, L], n = 1, 2,.... (0.1) L = Λ −1 a + bΛ 0 + Λ, (0.2) with Λ being the customary shift Λ: = (δi,j−1)i,j≥0 and a and b being diagonal matrices. As is well known, in analogy with Sato’s KPtheory, the entries a and b have the following τfunction representation bn = ∂ ∂t1 log ..."
Abstract
 Add to MetaCart
= [(L n)+, L] = [−(L n)−, L], n = 1, 2,.... (0.1) L = Λ −1 a + bΛ 0 + Λ, (0.2) with Λ being the customary shift Λ: = (δi,j−1)i,j≥0 and a and b being diagonal matrices. As is well known, in analogy with Sato’s KPtheory, the entries a and b have the following τfunction representation bn = ∂ ∂t1
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Discrete Mathematics and Theoretical Computer Science (subm.), by the authors, 1–rev Defect Effect of Biinfinite Words in the
"... Let X be a twoelement set of words over a finite alphabet. If a biinfinite word possesses two Xfactorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates. Note, that this is a strict sharpening of a defect theorem for biinfinite words stated in [KMP2] ..."
Abstract
 Add to MetaCart
Let X be a twoelement set of words over a finite alphabet. If a biinfinite word possesses two Xfactorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates. Note, that this is a strict sharpening of a defect theorem for biinfinite words stated in [KMP2
Results 1  10
of
1,672,983