scholarly journals On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms

2004 ◽  
Vol 13 (4) ◽  
pp. 421-438 ◽  
Author(s):  
Philippe de Groote ◽  
Sylvain Pogodalla
Keyword(s):  
Expressive Power ◽  
Categorial Grammars ◽  
Context Free

scholarly journals S4 enriched multimodal categorial grammars are context-free

2007 ◽  
Vol 388 (1-3) ◽  
pp. 173-180 ◽  
Author(s):  
Andrew R. Plummer
Keyword(s):  
Categorial Grammars ◽  
Context Free

scholarly journals A Novel method to represent Access Tree structure by Context Free Grammar with and-or graph in Key Policy based Attribute based Encryption

2018 ◽  
Vol 7 (4.10) ◽  
pp. 396
Author(s):  
K. Senthil Kumar ◽  
D. Malathi
Keyword(s):  
Access Control ◽  
Control Structure ◽  
Expressive Power ◽  
Third Party ◽  
Efficient Manner ◽  
Context Free Grammar ◽  
Fine Grained ◽  
Attribute Based Encryption ◽  
Key Policy ◽  
Context Free

Important and sensitivity data of users in a third party managed internet or cloud always pose various security as well as privacy issues. Attribute-based encryption (ABE) is a pleasant trend in the literature which addresses above problem in an efficient way, and provides data security and fine-grained access control in a decentralized manner,. Key-policy attribute-based encryption (KP-ABE) is an important type of ABE, in which user can decrypt his message with a set of attributes and private keys are embedded with a access control structure which defines which cipher text  an user can be allowed to decrypt. In this paper we use a probabilistic context free grammar with an And-Or structure to represent access control structure. And-Or graph has high expressive power hence access control structure can be represented in an efficient manner.  

ON ALTERNATING PHRASE-STRUCTURE GRAMMARS

2010 ◽  
Vol 21 (01) ◽  
pp. 1-25
Author(s):  
ETSURO MORIYA ◽  
FRIEDRICH OTTO
Keyword(s):  
Phrase Structure ◽  
Expressive Power ◽  
Context Sensitive ◽  
Leftmost Derivation ◽  
Context Free ◽  
Pushdown Automata ◽  
Context Free Grammars

The concepts of alternation and of state alternation are extended from context-free grammars to context-sensitive and arbitrary phrase-structure grammars. For the resulting classes of alternating grammars the expressive power is investigated with respect to the leftmost derivation mode and with respect to the unrestricted derivation mode. In particular new grammatical characterizations for the class of languages that are accepted by alternating pushdown automata are obtained in this way.

scholarly journals Patterns, Graphs and DNA

1994 ◽  
Vol 23 (484) ◽  
Author(s):  
Brian H. Mayoh
Keyword(s):  
Expressive Power ◽  
Transfer Rna ◽  
Neural Nets ◽  
Graph Grammars ◽  
Dna And Rna ◽  
Virus Rna ◽  
Pattern Approach ◽  
Genetic Algorithm Approach ◽  
Dna Pattern ◽  
Context Free

Two papers in one! The first, ``On Patterns and Graphs´´, describes the pattern version of context-free grammars for many kinds of substitution structures. By giving striking examples, particularly for emotional neural nets and other forms of graph grammars, it shows that the extra expressive power of pattern multigrammars is worth having. The second paper, ``DNA pattern multigrammars´´ describes the pattern approach to the analysis of the secondary structure of DNA and RNA; in particular it gives an analysis of Tobacco Mosaic Virus RNA, Transfer RNA, and genetic switching in the bacteriophage l. The genetic algorithm approach to the machine learning of DNA and RNA grammars is also discussed.

scholarly journals S4 enriched multimodal categorial grammars are context-free: Corrigendum

2008 ◽  
Vol 403 (2-3) ◽  
pp. 406-408 ◽  
Author(s):  
Andrew R. Plummer
Keyword(s):  
Categorial Grammars ◽  
Context Free

scholarly journals On the Expressive Power of Stateless Ordered Restart-Delete Automata

2021 ◽  
Author(s):  
Friedrich Otto
Keyword(s):  
Expressive Power ◽  
Single Letter ◽  
Regular Languages ◽  
Descriptional Complexity ◽  
Context Free

AbstractStateless ordered restart-delete automata (stl-ORD-automata) are studied. These are obtained from the stateless ordered restarting automata (stl-ORWW-automata) by introducing an additional restart-delete operation, which, based on the surrounding context, deletes a single letter. While the stl-ORWW-automata accept the regular languages, we show that the swift stl-ORD-automata yield a characterization for the class of context-free languages. Here a stl-ORD-automaton is called swift if it can move its window to any position after performing a restart. We also study the descriptional complexity of swift stl-ORD-automata and relate them to limited context restarting automata.

Representing Control: a Study of the CPS Transformation

1992 ◽  
Vol 2 (4) ◽  
pp. 361-391 ◽  
Author(s):  
Oliver Danvy ◽  
Andrzex Filinski
Keyword(s):  
Expressive Power ◽  
Future Research ◽  
Executable Code ◽  
Transformation Algorithm ◽  
Program Manipulation ◽  
Context Free ◽  
Recursive Definitions ◽  
Control Operators

This paper investigates the transformation of λν-terms into continuation-passing style (CPS). We show that by appropriate η-expansion of Fisher and Plotkin's two-pass equational specification of the CPS transform, we can obtain a static and context-free separation of the result terms into “essential” and “administrative” constructs. Interpreting the former as syntax builders and the latter as directly executable code, We obtain a simple and efficient one-pass transformation algorithm, easily extended to conditional expressions, recursive definitions, and similar constructs. This new transformation algorithm leads to a simpler proof of Plotkin's simulation and indifference results.We go on to show how CPS-based control operators similar to, more general then, Scheme's call/cc can be naturally accommodated by the new transformation algorithm. To demonstrate the expressive power of these operators, we use them to present an equivalent but even more concise formulation of the efficient CPS transformation algorithm. Finally, we relate the fundamental ideas underlying this derivation to similar concepts from other work on program manipulation; we derive a one-pass CPS transformation of λn-terms; and we outline some promising areas for future research.

Sign in / Sign up

Export Citation Format

Share Document