Results 1  10
of
4,843
Parallel RAMs with Owned Global Memory and Deterministic ContextFree Language Recognition
, 1997
"... We identify and study a natural and frequently occurring subclass of ConcurrentRead, ExclusiveWrite Parallel Random Access Machines (CREWPRAMs). Called ConcurrentRead, OwnerWrite, or CROWPRAMs, these are machines in which each global memory location is assigned a unique "owner" proc ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
We identify and study a natural and frequently occurring subclass of ConcurrentRead, ExclusiveWrite Parallel Random Access Machines (CREWPRAMs). Called ConcurrentRead, OwnerWrite, or CROWPRAMs, these are machines in which each global memory location is assigned a unique "owner" processor, which is the only processor allowed to write into it. Considering the difficulties that would be involved in physically realizing a full CREWPRAM model, it is interesting to observe that in fact, most known CREWPRAM algorithms satisfy the CROW restriction or can be easily modified to do so. This paper makes three main contributions. First, we formally define the CROWPRAM model and demonstrate its stability
On Learning A Class of Contextfree Languages in Polynomial Time
"... Abstract. The problem of learning contextfree languages is studied, in which a subclass called cdeterministic contextfree languages is introduced. The class of cdeterministic contextfree languages properly contains the class of regular sets. It is shown that the class of cdeterministic context ..."
Abstract
 Add to MetaCart
Abstract. The problem of learning contextfree languages is studied, in which a subclass called cdeterministic contextfree languages is introduced. The class of cdeterministic contextfree languages properly contains the class of regular sets. It is shown that the class of cdeterministic
Restarting Automata, Marcus Grammars and ContextFree Languages
, 1996
"... We investigate the computational power of several types of restarting automata  nondeterministic, deterministic; monotonic; normal  and compare them to (deterministic) contextfree languages. The relation between restarting automata and Marcus contextual grammars is discussed and a class of contex ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We investigate the computational power of several types of restarting automata  nondeterministic, deterministic; monotonic; normal  and compare them to (deterministic) contextfree languages. The relation between restarting automata and Marcus contextual grammars is discussed and a class
Abstract Fast Parallel Recognition of LR Language Suffixes
"... It is shown that suffix recognition for deterministic contextfree languages can be done on a PRAM multiprocessor within the upper complexity bounds of the graph reachability problem. ..."
Abstract
 Add to MetaCart
It is shown that suffix recognition for deterministic contextfree languages can be done on a PRAM multiprocessor within the upper complexity bounds of the graph reachability problem.
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 569 (0 self)
 Add to MetaCart
"Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications
Boolean algebras of unambiguous contextfree languages
"... ABSTRACT. Several recent works have studied subfamilies of deterministic contextfree languages with good closure properties, for instance the families of inputdriven or visibly pushdown languages,ormoregenerallyfamiliesoflanguagesacceptedbypushdownautomatawhosestackheight can be uniquely determine ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
ABSTRACT. Several recent works have studied subfamilies of deterministic contextfree languages with good closure properties, for instance the families of inputdriven or visibly pushdown languages,ormoregenerallyfamiliesoflanguagesacceptedbypushdownautomatawhosestackheight can be uniquely
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
Using Prior Knowledge in a NNPDA to Learn ContextFree Languages
"... Although considerable interest has been shown in language inference and automata induction using recurrent neural networks, success of these models has mostly been limited to regular languages. We have previously demonstrated that Neural Network Pushdown Automaton (NNPDA) model is capable of learni ..."
Abstract
 Add to MetaCart
of learning deterministic contextfree languages (e.g., anbn and parenthesis languages) from examples. However, the learning task is computationally intensive. In this paper we discus some ways in which a priori knowledge about the task and data could be used for efficient learning. We also observe
Ordered ContextFree Grammars
"... Contextfree grammars (CFGs) provide an intuitive and powerful formalism for describing the syntactic structure of parsable input streams. Unfortunately, existing online parsing algorithms for such streams admit only a subset of possible CFG descriptions. Theoretically, it is possible to parse any ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
deterministic contextfree language (CFL) in a single pass, as long as the grammar describing the CFL belongs to the LR(k), k ≥ 1 subset of CFGs. However, obtaining a suitable LR(k) description for a language is not an easy task — especially when k = 1 — and usually entails an increase in complexity
Monotonic Rewriting Automata with a Restart Operation
"... We introduce a hierarchy of monotonic rewriting automata with a restart operation and show that its deterministic version collapses in a sequence of characterizations of deterministic contextfree languages. The nondeterministic version of it gives a proper hierarchy of classes of languages with ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce a hierarchy of monotonic rewriting automata with a restart operation and show that its deterministic version collapses in a sequence of characterizations of deterministic contextfree languages. The nondeterministic version of it gives a proper hierarchy of classes of languages
Results 1  10
of
4,843