We define a new invariant for shift equivalence of sofic shifts. This invariant, that we call the syntactic graph of a sofic shift, is the directed acyclic graph of characteristic groups of the non null regular D-classes of the syntactic semigroup of the shift.

A regular language L over an alphabet A is called piecewise testable if it is a finite boolean combination of languages of the form Aa1A a2A ∗ . . . Aa`A ∗, where a1, . . . , a` ∈ A, ` ≥ 0. An effective characterization of piecewise testable languages was given in 1972 by Simon who proved that a language L is piecewise testable if and only if its syntactic monoid is J -trivial. Nowadays there e...

e description of the reciprocity phenomenon is more tricky than it is supposed in grammatical handbooks: It must cover both the issues of lexicon and of syntax and of their interplay as well. e lexical counterpart of the English expression each other is not the central (core) means for denoting reciprocity in some Slavonic languages, esp. in Czech. e troublemaking Czech reflexive se/siplays ...

Natural language understanding (NLU) focusing on machine reading comprehension is a branch of natural language processing (NLP). The domain of the developing NLU system covers from sentence decoding to text understanding and the automatic decoding of GP sentence belongs to the domain of NLU system. GP sentence is a special linguistic phenomenon in which processing breakdown and backtracking are...

PURPOSE To examine how language production interacts with speech motor and gross and fine motor skill in children with specific language impairment (SLI). METHOD Eleven children with SLI and 12 age-matched peers (4-6 years) produced structurally primed sentences containing particles and prepositions. Utterances were analyzed for errors and for articulatory duration and variability. Standard m...