The purpose of this study was to evaluate whether increased utterance length and grammatical complexity are associated with changes in frequency of systematic speech errors (i.e., phonological processes, or sound changes affecting an entire class of sounds or sound sequence [Edwards & Shriberg, 1983]), and nonsystematic speech errors (i.e., a word or string of words that apparently deviates fro...

This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created in an effort to promote the development of new and better grammatical inference algorithms for context-free languages, to provide a forum for the comparison of different grammatical inference algorithms and to gain in...

This study aimed at investigating the relative impact of comprehensible input and comprehensible output on the development of grammatical accuracy and syntactic complexity of Iranian EFL learners’ oral production. Participants were 60 female EFL learners selected from a whole population pool of 80 based on the standard test of IELTS. To investigate the research questions, the participants were ...

The Ewald method is applied to accelerate the evaluation of the Green’s function (GF) of an infinite equispaced linear array of point sources with linear phasing. Only a few terms are needed to evaluate Ewald sums, which are cast in terms of error functions and exponential integrals, to high accuracy. It is shown analytically that the choice of the standard ‘‘optimal’’ Ewald splitting parameter...

Recently, Piri and Kumam [Fixed Point Theory and Applications 2014, 2014:210] improved concept of F -contraction and proved some Wardowski and Suzuki type …xed point results in metric spaces. The aim of this article is to de…ne generalized GF -contraction and establish Wardowski and Suzuki type …xed point results in metric and ordered metric spaces and derive main results of Piri et al. as coro...

The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Three measures of trellis complexity are considered: the total number of states, the total number of edges, and the maximum state complexity of the trellis. The problem is proven NP-hard for all three measures, provided the eld over which the code is speciied is not xed. We leave open the problem of...