Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of ω-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is accepted by some Büchi automaton. We consider the descriptional complexity of various constructions for weakly recognizing morphisms. This includes the conversion f...

The communication structure of parallel communicating grammar systems (PCGS) considered as the descriptional complexity of PCGS is investigated here. The aim of the paper is to compare computational power of PCGS’s with respect to their communication structure. Investigating the generation of the languages over one-letter alphabet the communication structures dags(directed acyclic graphs) and c...

We prove that the set of properties describable by a uniform sequence of rst-order sentences using at most k + 1 distinct variables is exactly equal to the set of properties checkable by a Turing machine in DSPACEn k ] (where n is the size of the universe). This set is also equal to the set of properties describable using an iterative deenition for a nite set of relations of arity k. This is a ...

The use of writing strategy across levels in a virtual EFL course was still rarely found the literature. To fill this gap, therefore, current research aims at exploring instruction. Informed by framework descriptive case study, university student-writers who regularly attended academic filled out online inventory (Yang & Plakans, 2012) and submitted argumentative essays. findings show that ...

Automating the task of scoring short handwritten student essays is considered. The goal is to assign scores which are comparable to those of human scorers by coupling two AI technologies: optical handwriting recognition and automated essay scoring. The test-bed is that of essays written by children in reading comprehension tests. The process involves several image-level operations: removal of p...

This report describes the development of grade norms for timed-writing performance in two modes of writing: persuasive and descriptive. These norms are based on objective and automatically computed measures of writing quality in grammar, usage, mechanics, style, vocabulary, organization, and development. These measures are also used in the automated essay scoring system e-rater V.2. Norms were ...

technology application: the Criterion Online Essay Evaluation Service, a web-based system that provides automated scoring and evaluation of student essays. Criterion has two complementary applications: (1) Critique Writing Analysis Tools, a suite of programs that detect errors in grammar, usage, and mechanics, that identify discourse elements in the essay, and that recognize potentially undesir...