Filters








323,188 Hits in 4.3 sec

Page 6510 of Mathematical Reviews Vol. , Issue 98J [page]

1998 Mathematical Reviews  
Summary: “This paper introduces weakly growing context- sensitive grammars.  ...  Such grammars generalize the class of 68 COMPUTER SCIENCE 6510 growing context-sensitive grammars, in that these grammars have rules that ‘grow’ according to a position valuation.  ... 

Groups that do and do not have context-sensitive word problem [article]

Derek F. Holt, Sarah Rees, Michael Shapiro
2008 arXiv   pre-print
This adds to the examples of Kambites and Otto of groups separating context-sensitive and growing context-sensitive word problems, and provides a new language-theoretic separation result.  ...  We prove that a group has word problem that is a growing context-sensitive language precisely if its word problem can be solved using a non-deterministic Cannon's algorithm (the deterministic algorithms  ...  The language of the grammar is the set of words w ∈ X * with σ → * w. A growing context-sensitive language (GCSL) is a language defined by a growing context-sensitive grammar (GCSG).  ... 
arXiv:0801.4533v1 fatcat:lug5ib6mljelzjjk46eg42reda

GROUPS THAT DO AND DO NOT HAVE GROWING CONTEXT-SENSITIVE WORD PROBLEM

DEREK F. HOLT, SARAH REES, MICHAEL SHAPIRO
2008 International journal of algebra and computation  
This adds to the examples of Kambites and Otto in [7] of groups separating context-sensitive and growing contextsensitive word problems, and provides a new language-theoretic separation result.  ...  We prove that a group has word problem that is a growing contextsensitive language precisely if its word problem can be solved using a non-deterministic Cannon's algorithm (the deterministic algorithms  ...  The language of the grammar is the set of words w ∈ X * with σ → * w. A growing context-sensitive language (GCSL) is a language defined by a growing context-sensitive grammar (GCSG).  ... 
doi:10.1142/s0218196708004834 pmid:19997524 pmcid:PMC2789434 fatcat:epgfqrvulfexfbtua4fldbkp5i

Page 512 of Mathematical Reviews Vol. , Issue 2004a [page]

2004 Mathematical Reviews  
(D-DARM-IF; Darmstadt) The growing context-sensitive languages are the acyclic context-sensitive languages.  ...  Moreover, we prove in two different ways that a CPN language is a context-sensitive language.”  ... 

Page 3632 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
In this paper we examine the variable membership problem for different types of grammars, namely context-sensitive grammars (CSGs), quasi-context-sensitive gram- mars (QCSGs), growing context-sensitive  ...  grammars (GCSGs), quasigrowing context-sensitive grammars (QGCSGs), and quasi- growing grammars (QGGs).  ... 

Page 5983 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
{For the entire collection see MR 94i:68010.} 68Q Theory of computing 94j:-68153 94j:68150 68Q45 68Q50 Buntrock, Gerhard (D-WRZB-I; Wiirzburg); Lorys, Krzysztof (PL-WROC-C; Wroclaw) On growing context-sensitive  ...  One of the questions arising from this paper is how to ex- tend this concept to context sensitive grammars (CSGs).  ... 

Cellular automata as models of complexity

Stephen Wolfram
1984 Nature  
: • Regular languages (computation model -> Finite State Automaton): No memory required • Context-free languages (computation model -> Non-deterministic Pushdown Automaton): Need LIFO stack • Context-sensitive  ...  paper concentrates on general mathematical features of behavior -not specific applications Information Propagation • The degree of sensitivity to initial conditions shows us degrees of predictability  ... 
doi:10.1038/311419a0 fatcat:kbs6fi7g5vb6dhyuuzf6bdz6xq

Page 831 of Mathematical Reviews Vol. 43, Issue 3 [page]

1972 Mathematical Reviews  
Four types of errors are defined and their effects on regular, deterministic and non-deterministic context-free, context- sensitive, and recursive languages are studied.  ...  There exist deterministic context-sensitive languages which are closed under a finite number of errors, and others which are not closed under one error.  ... 

Page 6990 of Mathematical Reviews Vol. , Issue 96k [page]

1996 Mathematical Reviews  
Finally, we prove that each growing context-sensitive language is accepted in polynomial time by some one-way auxiliary pushdown automaton with a logarithmic space bound.  ...  Summary: “The growing context-sensitive languages (GCSL) are characterized by a nondeterministic machine model, the so-called shrinking two-pushdown automaton (sTPDA).  ... 

The size of Higman–Haines sets

Hermann Gruber, Markus Holzer, Martin Kutrib
2007 Theoretical Computer Science  
This nicely contrasts the result on the effectiveness of the Higman-Haines sets for the family of context-free languages.  ...  The non-effectiveness is based on a non-recursive tradeoff result between the language description mechanism of Church-Rosser languages and the corresponding Higman-Haines sets, which in turn is also valid  ...  subset of growing context-sensitive languages.  ... 
doi:10.1016/j.tcs.2007.07.036 fatcat:pj5zmp5dfvhuvjridivq7l4zia

Linear Context-Free Rewriting Systems

Laura Kallmeyer
2013 Language and Linguistics Compass  
length grows in a linear way.  ...  is mildly context-sensitive iff (a) L contains all context-free languages.  ... 
doi:10.1002/lnc3.359 fatcat:vxfwzbievfcs7ailnji4hnaipi

Page 2645 of Mathematical Reviews Vol. , Issue 88e [page]

1988 Mathematical Reviews  
for growing context-sensitive grammars is polynomial.  ...  A context-sensitive grammar is said to be growing if for all produc- tions a — B the relation /(a) < /(f) between the lengths of a and B is satisfied.  ... 

Interactive L systems with almost interactionless behaviour

Karel Culik, J. Karhumäki
1979 Information and Control  
A P2L system is called an essentially growing 2L-systems (e-G2L system) if every lengthpreserving production is intcractionless (context-free).  ...  One way to get such systems is if wc allow interaction only whcn cells are dividing but not when they arc mcrcly changing states.  ...  We show that it can be simulated, in a sense, by a D2L system with strictly growing context-sensitive productions and arbitrary context-free productions.  ... 
doi:10.1016/s0019-9958(79)90094-9 fatcat:4camr7hpuze2rntpxpcjv7cbea

Culture as a binder for bilingual acquisition

Padmapriya Kandhadai, D. Kyle Danielson, Janet F. Werker
2014 Trends in Neuroscience and Education  
Given that language acquisition occurs within a broader cultural context, we propose that culture may provide a binder for language acquisition, particularly for a bilingual learner.  ...  Babies growing up bilingual attune to the speech sounds, rhythm, and intonation of each of their native languages; establish word meanings; and acquire syntax.  ...  As acquisition proceeds, in some cases the two native languages might be embedded in largely overlapping cultural contexts, with only subtle cultural cues distinguishing one context from another.  ... 
doi:10.1016/j.tine.2014.02.001 fatcat:sju5bt4gprh2hdpnwxb7ybz3bm

Reduced sensitivity to context in language comprehension: A characteristic of Autism Spectrum Disorders or of poor structural language ability?

Melanie Eberhardt, Aparna Nadig
2018 Research in Developmental Disabilities  
Both ASD-variable language and LI groups exhibited reduced context sensitivity and did not differ from each other.  ...  These convergent findings demonstrate that reduced sensitivity to context in language processing is linked to low structural language rather than ASD diagnosis.  ...  Special thanks also to Ronda Booth for information on coding in their study with a sentence completion task.  ... 
doi:10.1016/j.ridd.2016.01.017 pmid:26898317 pmcid:PMC4990504 fatcat:6dmfukwzhvembobcdm3nt2vqta
« Previous Showing results 1 — 15 out of 323,188 results