The quotient complexity of a regular language L, which is the same as its state complexity, is the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n quotients, which can be uncomplemented or complemented. An NFA is atomic if the right language of every state is a union of atoms. We characterize all reduced atomic NFAs ...

The field of implicit complexity has recently produced several bounded-complexity programming languages. This kind of language allows to implement exactly the functions belonging to a certain complexity class. We here present a realizability semantics for a higher-order functional language based on a fragment of linear logic called LAL which characterizes the complexity class PTIME. This langua...

1. From the point of view of the general cybernetic theory we consider language to be a device, which regulates the information streams in social systems. 1 On this basis it is possible to come to the conclusion of bilateral dependency of the language organization level (the level of its complexity) on (1) complexity value of the language mechanism input information stream, and (2) complexity v...

Constraint Handling Rules (CHR) is a very-high-level declarative programming language based on concurrent multiset rewrite rules that are conditional, multiheaded, and committed-choice. Originally designed in the early 1990s as a specialpurpose programming language for adding user-defined constraint solvers to a host language, CHR has evolved over the last decade into a powerful and elegant gen...

The favorable gains gleaned from the provision of pre-task planning time (PTP) have struck a chord with SLA researchers as they try to manipulate task features to promote language production and development. In a similar vein, the present study is a two-fold attempt to first compare the effect of the length of pre-task planning time on discourse-analytic measures in narrative written production...

In this mathematical approach to language complexity, a previously proposed formula for measuring grammar complexity is derived in a different way and somewhat modified. The formula measures relative language complexity, “relative” because the conveyed linguistic information is taken into account. Many examples, either abstract or representing structures of natural languages, are used in the de...