نتایج جستجو برای: syntactic complexity
تعداد نتایج: 343441 فیلتر نتایج به سال:
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of Rand J -trivial regular languages, and prove that n! and ⌊e(n −...
Syntactic complexity has long been taken as a significant factor in determining writing quality by EFL learners. And researchers recent years have made lot of efforts to devise and verify wide range factors or indicators for the purpose measuring syntactic predicting quality. The present study discussed bases itself on self-built learner corpus with data collected over three years, aim applicab...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید