Add to ORKGA family of languages is called arithmetic if each infinite language in it is such that its length set contains an arithmetic progression. It is proved that there exists an ETOL language which is not an arithmetic substitution of any EDTOL language. This result shed some light on the question: How much more “complicated” are ETOL languages than EDTOL languages
Solving arithmetic problems is a cognitive task that heavily relies on language processing. One migh...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
Campbell (1998) has questioned the conclusion of Noël et al. (1997) and has argued that alternative ...
A result is provided which allows one to prove that certain language are not EOL languages
This paper is concerned with deterministic ETOL languages. A theorem is proved which, roughly speaki...
A new subclass of EOL languages is introduced. Several properties of languages in this class are pro...
AbstractThis paper provides a method of “decomposing” a subclass of ET0L languages into deterministi...
A characterization theorem is given for a class of developmental languages. The theorem binds togeth...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
One of the useful results concerning EOL languages states that a language is an EOL language if and ...
It is proved that a language is a coding (a letter-to-letter homomorphism) of a OL language, if, and...
The notion of an ETOL system with rank is defined. It extends naturally studied already notions of a...
There exists a PT0L language $L_0$ such that the following holds. A language $L$ is an ET0L language...
AbstractEDTOL systems can be used to approximate real numbers by considering the limit of the ratio ...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
Solving arithmetic problems is a cognitive task that heavily relies on language processing. One migh...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
Campbell (1998) has questioned the conclusion of Noël et al. (1997) and has argued that alternative ...
A result is provided which allows one to prove that certain language are not EOL languages
This paper is concerned with deterministic ETOL languages. A theorem is proved which, roughly speaki...
A new subclass of EOL languages is introduced. Several properties of languages in this class are pro...
AbstractThis paper provides a method of “decomposing” a subclass of ET0L languages into deterministi...
A characterization theorem is given for a class of developmental languages. The theorem binds togeth...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
One of the useful results concerning EOL languages states that a language is an EOL language if and ...
It is proved that a language is a coding (a letter-to-letter homomorphism) of a OL language, if, and...
The notion of an ETOL system with rank is defined. It extends naturally studied already notions of a...
There exists a PT0L language $L_0$ such that the following holds. A language $L$ is an ET0L language...
AbstractEDTOL systems can be used to approximate real numbers by considering the limit of the ratio ...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
Solving arithmetic problems is a cognitive task that heavily relies on language processing. One migh...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
Campbell (1998) has questioned the conclusion of Noël et al. (1997) and has argued that alternative ...