BACKGROUND The present study investigated the role of early language abilities in the development of math skills among Chinese K-3 students. About 2000 children in China, who were on average aged 6 years, were assessed for both informal math (e.g., basic number concepts such as counting objects) and formal math (calculations including addition and subtraction) skills, language abilities and non...

introduction: one of the important evaluative indexes of language development is word finding ability. the application of formal assessment tools, such as twf-2, is the most common way of assessing this ability in western countries. there is not any formal assessment tool for assessment of this ability in iran. therefore this study aimed to determine the validity and reliability of persian vers...

â â€œshodan” is a multifunctional verb in persian language. this paper deals with six different functions of “shodan” based on a purely formal approach. these functions are as follows: liking verb, light verb in some compound predicates, auxiliary verb, helping verb in passive voice, modal verb, and simple verb. the interface between lexicon and syntax, and the ways to show this relations...

The natural language learning problem has attracted the attention of researchers for several decades. Computational and formal models of language acquisition have provided some preliminary, yet promising insights of how children learn the language of their community. Further, these formal models also provide an operational framework for the numerous practical applications of language learning. ...

To define the formal semantics of a modeling language, one normally starts from the abstract syntax and then defines the static semantics and dynamic semantics. Having a formal semantics is important for reasoning about the language but also for building tools for the language. In this paper we propose a novel approach for this task based on the Alloy language. With the help of a concrete examp...

We show interreducibility under (Turing) reductions of low polynomial degree between three families of problems parametrised by classes of formal languages: the problem of reachability in a directed graph constrained by a formal language, the problem of deciding whether or not the intersection of a language of some class with a regular language is empty, and the model checking problem for Propo...