The Associative Language Description model (ALD) is a combination of locally testable and constituent structure ideas. It is consistent with current views on brain organization and can rather conveniently describe typical technical languages such as Pascal or HTML. ALD languages are strictly enclosed in context-free languages but in practice the ALD model equals CF grammars in explanatory adequacy. Various properties of ALD have been investigated, but many theoretical questions are still open. For instance, it is unknown, at the present, whether the ALD family includes the regular languages. Here it is proved that several known classes of regular languages are ALD: threshold locally testable languages, group languages, positive commu...
We consider the problem of defining regular expressions to characterize the class of recognizable p...
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
AbstractThe new Associative Language Description (ALD) model, a combination of locally testable and ...
AbstractThe new Associative Language Description (ALD) model, a combination of locally testable and ...
AbstractIn this paper, we mainly focus on the properties of word-paired catenations of regular langu...
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
A classical result (often credited to Y. Medvedev) states that every language recognized by a finite...
We consider the problem of defining regular expressions to characterize the class of recognizable p...
We consider the problem of defining regular expressions to characterize the class of recognizable p...
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
The Associative Language Description model (ALD) is a combination of locally testable and constituen...
AbstractThe new Associative Language Description (ALD) model, a combination of locally testable and ...
AbstractThe new Associative Language Description (ALD) model, a combination of locally testable and ...
AbstractIn this paper, we mainly focus on the properties of word-paired catenations of regular langu...
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
A classical result (often credited to Y. Medvedev) states that every language recognized by a finite...
We consider the problem of defining regular expressions to characterize the class of recognizable p...
We consider the problem of defining regular expressions to characterize the class of recognizable p...
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in...
AbstractThe paper studies classes of regular languages based on algebraic constraints imposed on tra...