A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Contextual Array Grammars with Matrix and Regular Control
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages. ...
For d ≥ 2, d-dimensional contextual array grammars are less powerful than matrix contextual array grammars, which themselves are less powerful than contextual array grammars with regular control languages ...
In this paper we consider matrix contextual array grammars and contextual array grammars with regular control and examine their generative power. ...
doi:10.1007/978-3-319-41114-9_8
fatcat:2kyzz6kqrzb75pidwu6opbj43a
Page 4575 of Mathematical Reviews Vol. , Issue 98G
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “As in the string case, for n-dimensional array gram- mars we obtain regular, context-free, and monotonic grammars by imposing specific restrictions on the corresponding array produc- tions. ...
In contextual grammars this recursion is given explicitly by associat- ing the context (x, y) with the string z. ...
Page 3749 of Mathematical Reviews Vol. , Issue 81I
[page]
1981
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Control Engrg. 5 (1980), no. 1, 21-29.
The author defines the notion of n-contextual grammars with type 1, 2 or 3 choice. ...
of a context-free grammar G controlled by a regular subset R of the Szilard language of G. ...
Page 5888 of Mathematical Reviews Vol. , Issue 98I
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
These families include lan- guages generated by controlled (CF) grammars (with and without ac), matrix grammars (with and without ac), vector grammars, programmed grammars (with and without ac), conditional ...
Summary: “We consider (n-dimensional) array grammars in the accepting mode with various control mechanisms and compare these families of array grammars with the corresponding families obtained by array ...
Page 2948 of Mathematical Reviews Vol. , Issue 83h
[page]
1983
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Abraham [Inform. and Control 20 (1972), 432-438;
MR 48 #12902] to increase the generative capacity of regular matrix
grammars. ...
Author’s summary: “In this paper, we study closure properties of the families of n-contextual with choice, inner n-contextual and generalized n-contextual languages, respectively. ...
Page 5118 of Mathematical Reviews Vol. , Issue 83m
[page]
1983
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The author introduces three subclasses of n-contextual grammars, as generalizations of the families of contextual grammars with choice, generalized contextual grammars and inner contextual grammars. ...
Author’s summary: “Two new isometric array languages, called linear array languages and extended regular array languages, are introduced. ...
Page 2135 of Mathematical Reviews Vol. , Issue 85e
[page]
1985
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Table matrix L systems constitute a special class of two-dimen-
sional L systems. Essentially, we are dealing with a rectangular
array. ...
However, some questions remain open, for example, whether all context-free languages can be generated by contextual schemes having regular context, only one rewriting point, and regular control language ...
Page 1637 of Mathematical Reviews Vol. 42, Issue 6
[page]
1971
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Ibarra, Oscar H. 9107 Simple matrix languages. Information and Control 17 (1970), 359-394. The author introduces and then studies certain subfamilies of matrix languages. ...
If (3d) is replaced by (3d’) [A,—>2,B,, ---, A,—>2,B,], with 2, in =* and A,, B, in V, for each i, then G is called a right- linear simple matrix grammar of degree n and L(@) is called an n-RLSM language ...
k-Local Internal Contextual Grammars
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Also, we propose an efficient algorithmic solution for the membership problem for k-local contextual grammars with polynomial choice. ...
In this paper we propose a generalization of the local internal contextual grammars, introduced by Ilie in 1997, namely the k-local internal contextual grammars. ...
Example 3.3 Let G = ({a, b, c}, {abc}, ({ab + }, (a, bc))) be an internal contextual grammar with regular choice. ...
doi:10.1007/978-3-642-22600-7_14
fatcat:r3kz3d4uf5adbdyr5nzdgfphha
Parallel Communicating Grammar Systems
[chapter]
1993
Current Trends in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Each of the grammars rewrites the sentential form until a certain condition is met. Then it passes it to the next grammar, and so on, until a terminal string is obtained. ...
Cellular automata [9] , Lindenmayer systems [18] , systolic trellis automata [3] , Russian parallel [4] and Indian parallel [4] grammars are some examples of such models based on formal language and automata ...
In fact, in [1] the study of pure grammar ( [19] ) and contextual grammar ([10]) PCGS's has already been initiated; • the components of the PCGS are dynamic. ...
doi:10.1142/9789812794499_0047
dblp:series/wsscs/Santean93
fatcat:fqcna5yxg5emzm7sqfityku7pq
Pattern matching in compilers
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Linear time complexity is obtained by introducing the novel notion of structured grammars and regularized regular expressions. ...
In this thesis we develop tools for effective and flexible pattern matching. We introduce a new pattern matching system called amethyst. ...
Amethyst grammars and expressions The syntax of a regular expression and its equivalent amethyst expression is similar. We embed amethyst expressions with (| e |) syntax. ...
arXiv:1210.3593v1
fatcat:ythkapb6drexnhyicdyfvcksuu
CodeGRU: Context-aware Deep Learning with Gated Recurrent Unit for Source Code Modeling
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We evaluated CodeGRU with real-world dataset and it shows that CodeGRU can effectively capture contextual, syntaxtual and structural dependencies which previous works fails. ...
The Code Regularize is next introduced to encode source code which helps capture the contextual dependencies of the source code. ...
layer and U is the weight matrix for the state to state matrix, and φ is an activation function. ...
arXiv:1903.00884v1
fatcat:kszst3womjchjfs3exbvfeo324
A Bio-Inspired Model of Picture Array Generating P System with Restricted Insertion Rules
2020
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The generative power of such a system is investigated by comparing with the generative power of certain related picture array grammar models introduced and studied in two-dimensional picture language theory ...
A new picture array model of array generating P system with a restricted type of picture insertion rules and picture array objects in its regions, is introduced here. ...
External parallel contextual array grammar is one such variant generating rectangular picture arrays and the family of picture array languages generated by this kind of array grammars is denoted by EPCA ...
doi:10.3390/app10228306
fatcat:ca2esvglnrekddg33vdqgmh574
Interactive Rule Attention Network for Aspect-level Sentiment Analysis
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
IRAN not only designs a grammar rule encoder, which simulates the grammatical functions at the sentence by standardizing the output of adjacent positions, but also constructs an interaction attention network ...
to learn attention information from context and target. ...
We obtain the hidden state with grammar rule information with rule encoder, then take the hidden state as input to obtain the aspect attention representation which obtains grammar rules, and finally we ...
doi:10.1109/access.2020.2981139
fatcat:xnohfni7vbewnbwxnj2iuurble
Two Forms of Implicit Learning in Young Adults with Dyslexia
2008
Annals of the New York Academy of Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Participants also completed the spatial contextual cueing task (SCCT), which involved learning a spatial regularity in which the location of distractors in some visual arrays predicted the target location ...
To assess implicit sequence learning in the absence of a motor sequence, 16 young adults diagnosed with dyslexia (20.6 ± 1.5 years) and 18 healthy controls (20.8 ± 2.0 years) completed a triplet frequency ...
We want to thank Carly Shoupe, Elizabeth Bonner, Tara Kraft, Richard Garlipp, and Lauren Mays for their help with data collection. ...
doi:10.1196/annals.1416.006
pmid:19076397
pmcid:PMC2691650
fatcat:3ok23kiptbbfzfq33k7jkqatge
« Previous
Showing results 1 — 15 out of 3,032 results