Results 1  10
of
4,128
On bounded languages and the geometry of nilpotent groups
 Combinatorial and geometric group theory, LMS Lecture Notes
"... Abstract. Bounded languages are a class of formal languages which includes all context free languages of polynomial growth. We prove that if a finitely generated group G admits a combing by a bounded language and this combing satisfies the asynchronous fellow traveller property, then either G is vir ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Bounded languages are a class of formal languages which includes all context free languages of polynomial growth. We prove that if a finitely generated group G admits a combing by a bounded language and this combing satisfies the asynchronous fellow traveller property, then either G
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 798 (0 self)
 Add to MetaCart
; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical contextfree programming language grammars. In an empirical comparison it appears to be superior to the topdown and bottomup algorithms studied by Griffiths
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension. We also consider the precision to which the transition amplitudes of a quantum Turing machine need
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 558 (0 self)
 Add to MetaCart
] is a bounded interval in R, in modern language the original statement of the theorem was that L 2 ([a, b]) is complete and abstractly isomorphic to l 2. According to [Jah03, p. 385], the name “Hilbert space ” was first used in 1908 by A. Schönflies, apparently to refer to what we today call l 2. Von
Bounded Languages Meet Cellular Automata with Sparse Communication
"... Cellular automata are onedimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the realtime oneway cellular automata, and impose an additional restriction on their intercell communication by bounding the number of allowed uses of the links b ..."
Abstract
 Add to MetaCart
between cells. Moreover, we consider the devices as acceptors for bounded languages in order to explore the borderline at which nontrivial decidability problems of cellular automata classes become decidable. It is shown that even devices with drastically reduced communication, that is, each two
Generating Bounded Languages Using Bounded Control Sets
"... Abstract. We study contextfree grammars whose generated language is bounded (that is, subset of some expression w˚1...w d called bounded expression). We investigate the underlying generating process of such language and show that there exists a bounded expression u˚1... um ̊ over the production rul ..."
Abstract
 Add to MetaCart
Abstract. We study contextfree grammars whose generated language is bounded (that is, subset of some expression w˚1...w d called bounded expression). We investigate the underlying generating process of such language and show that there exists a bounded expression u˚1... um ̊ over the production
Making the future safe for the past: Adding Genericity to the Java Programming Language
, 1998
"... We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps ty ..."
Abstract

Cited by 372 (16 self)
 Add to MetaCart
We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 273 (12 self)
 Add to MetaCart
Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size at most k . 'Invariance for kpartial isomorphism' means having the same truth value at tuples of objects in any two models that are connected by a partial isomorphism in such a set. The precise sense of this is spelt out in the following proof. 21 Proof (Outline.) kvariable formulas are preserved under partial isomorphism, by a simple induction. More precisely, one proves, for any assignment A and any partial isomorphism IÎI which is defined on the Avalues for all variables x 1 , ..., x k , that M, A = f iff N , IoA = f . The crucial step in the induction is the quantifier case. Quantified variables are irrelevant to the assignment, so that the relevant partial isomorphism can be res...
Results 1  10
of
4,128