We propose two hardware inverters for calculating the multiplicative inverses in finite fields GF (2): one produces a result in every O(m) time using O(m) area; and the other produces a result in every O(1) time using O ( m ) area. While existing O(m)-time inverters require at least two shift registers in the datapath, the proposed O(m)-time implementation uses only one, thus costing less hardw...

Given a bicircular matroid B(G) and q ∈ {4, 5}, we characterize when the bicircular matroid B(G) is GF (q)-representable by precisely describing the structure of G. These descriptions yield polynomial-time algorithms with input G to certify if B(G) is or is not GF (q)-representable.

Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (1994b), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to seve...

Although it is well-established that children with Specific Language Impairment characteristically optionally inflect forms that require tense and agreement marking, their abilities with regards to derivational suffixation are less well understood. In this paper we provide evidence from children with Grammatical-Specific Language Impairment (G-SLI) that derivational suffixes, unlike tense and a...

Young and older adults provided language samples in response to elicitation questions while concurrently performing 3 different tasks. The language samples were scored on three dimensions: fluency, grammatical complexity, and content. Previous research had suggested the hypothesis that the restricted speech register of older adults is buffered from the costs of dual task demands. This hypothesi...

Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets intractable. This paper presents a probabilistic model of English grammar that is much simpler than conventional models, but which admits an efficient EM training algorithm. The model is based upon grammatical bigrams, i....

This article is about the unexpected linguistic behavior that young children sometimes display by producing structures that are only marginally present in the adult language in a constrained way, and that adults do not adopt in the same experimental conditions. It is argued here that children's capacity to overextend the use of given syntactic structures thereby resulting in a grammatical creat...

Empirical evidence for statistical learning comes from artificial language tasks, but it is unclear how these effects scale up outside of the lab. The current study turns to a real-world test case of statistical learning where native English speakers encounter the syntactic regularities of Arabic through memorization of the Qur'an. This unique input provides extended exposure to the complexity ...

This study investigated the relationship between complex grammatical structures and complex action sequences. A developmental progression of strategies for combining seriated cups identified in an earlier study (Greenfield et al., 1972) was used to demonstrate some psychological consequences of formal parallels between language and action. The role of grammatical complexity and situational stru...

This study compared language development in 30-month-old toddlers on the autism spectrum and 25- month-old late talking toddlers without autism. Groups were matched on overall productive vocabulary (and nonverbal cognition was controlled) in order to compare language acquisition patterns related to vocabulary composition and early lexical–grammatical relationships. Findings revealed that semant...