Results 1  10
of
90
PPNAL: Performance Evaluation in an Algebraic Model for Probabilistic and Nondeterministic Processes
, 1999
"... In this paper we present an Algebraic Language which allows us to describe probabilistic and nondeterministic processes as well as to evaluate index performances: PPNAL (Performance Probabilistic and Non deterministic Algebraic Language). We also analyse the Alternating Bit Protocol by using this ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this language, showing the average time to send a message, taking into account that channels may fail with some known probability. 1 Syntax of the Language Let \Delta = fa; b; c; ::g be a set of action types. Let p; q; r be probabilities and let greek letters be time parameters of actions. Terms of PPNAL
On Serializable Languages
 University of Rochester, Department of Computer Science
, 1994
"... Cai and Furst introduced the notion of bottleneck Turing machines and showed that the languages recognized by width5 bottleneck Turing machines are exactly those in PSPACE. Computational power of bottleneck Turing machines with width fewer than 5 is investigated. It is shown that width2 bottleneck ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Cai and Furst introduced the notion of bottleneck Turing machines and showed that the languages recognized by width5 bottleneck Turing machines are exactly those in PSPACE. Computational power of bottleneck Turing machines with width fewer than 5 is investigated. It is shown that width2
Let's Accept Rejects, But Only After Repairs
"... In the quest for a useful syntax for language definition formalisms  the SDF part of ASD+SDF of Klint and his coworkers  Visser has proposed to extend context free rules with reject productions. We propose to modify the definition to ensure modularity of reject grammars. Next, attention is dr ..."
Abstract
 Add to MetaCart
developed for use in natural language analysis. 1 Reject Grammars To increase the versatility of the ASD+SDF metaenvironment for specification and syntax definition created by Paul Klint and his coworkers [6], Visser [9] proposes to add reject rules A ! r A 1 \Delta \Delta \Delta An to CF grammars
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
Fixed Points in Boundaries of Negatively Curved Groups
, 1994
"... e enhancement of the Pumping Lemma. fixpoint.tex 1 05/03/94 UltraPumping Lemma. Let fa i g be an Lray where L is a regular language over the finite alphabet A. There exists an integer M 0 such that, for each integer n ? 0, there exists an integer N n such that (a 1 \Delta \Delta \Delta aM )(a M ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
e enhancement of the Pumping Lemma. fixpoint.tex 1 05/03/94 UltraPumping Lemma. Let fa i g be an Lray where L is a regular language over the finite alphabet A. There exists an integer M 0 such that, for each integer n ? 0, there exists an integer N n such that (a 1 \Delta \Delta \Delta aM )(a
Uniqueness of the Positive Solution of Δu + f(u) = 0 in an Annulus
, 1991
"... We give here an extension of the recent result of Kwong (which in turn extended earlier results of Coffman and McLeod and Serrin) on the uniqueness of the positive radial solution of a semilinear elliptic equation. When reduced to the special case considered by Kwong, our proof is shorter. AMS(MOS) ..."
Abstract
 Add to MetaCart
subprogram of the Office of Energy Research, U. S. Department of Energy, under Contract W31109Eng38. y Current address: School of Mathematics, University of Minnesota, Minneapolis, MN 55455. 1 Introduction Let R n (n ? 2) denote the usual ndimensional Euclidean space. Given 0 a ! b 1, we
A ContextFree Language Decision Problem
"... Let k; ` 2 N and L ` fa; bg be a contextfree language and L k;` be the set of words, w, such that kjwj a \Gamma `jwj b = 0 where jwj a and jwj b are the numbers of occurrences of a and b in w, respectively. We give an EXPTIME (in grammar size) algorithm to decide whether or not (1) L " L ..."
Abstract
 Add to MetaCart
Let k; ` 2 N and L ` fa; bg be a contextfree language and L k;` be the set of words, w, such that kjwj a \Gamma `jwj b = 0 where jwj a and jwj b are the numbers of occurrences of a and b in w, respectively. We give an EXPTIME (in grammar size) algorithm to decide whether or not (1) L " L
Robust Universal Complete Codes for Transmission and Compression
 Discrete Applied Mathematics
, 1996
"... Several measures are defined and investigated, which allow the comparison of codes as to their robustness against errors. Then new universal and complete sequences of variablelength codewords are proposed, based on representing the integers in a binary Fibonacci numeration system. Each sequence is ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
;reallife" examples. 1. Motivation and Introduction Let A = fA 1 ; A 2 ; \Delta \Delta \Delta ; An g be a finite set of elements, called cleartext elements, to be encoded by a static uniquely decipherable (UD) code. For notational ease, we use the term `code' as abbreviation for `set of codewords
A Bounded Set Theory with AntiFoundation Axiom and Inductive Definability
 Computer Science Logic, 8th Workshop, CSL'94 Kazimierz
, 1995
"... this paper let \Deltaformulas and \Deltaterms be those defined as \Delta R with the construct theleast omitted. (They define predicates and operations also known as basic [Gan74] or rudimentary [Jen72] ones.) Note, that provablytotal \Sigma definable operations in KP 0 coincide with those defin ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
this paper let \Deltaformulas and \Deltaterms be those defined as \Delta R with the construct theleast omitted. (They define predicates and operations also known as basic [Gan74] or rudimentary [Jen72] ones.) Note, that provablytotal \Sigma definable operations in KP 0 coincide with those
On the Convergence Rate of a QuasiNewton Method for Inverse Eigenvalue Problems
 SIAM J. Numer. Anal
, 1997
"... In this paper, we first note that the proof of the quadratic convergence of the quasiNewton method as given in Friedland, Nocedal and Overton [1] is incorrect. Then we give a correct proof of the convergence. Keywords. Newton method, inverse eigenvalue problem. 1 Introduction Let fA j g n j=1 be n ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper, we first note that the proof of the quadratic convergence of the quasiNewton method as given in Friedland, Nocedal and Overton [1] is incorrect. Then we give a correct proof of the convergence. Keywords. Newton method, inverse eigenvalue problem. 1 Introduction Let fA j g n j=1
Results 1  10
of
90