We show that languages in the least full AFL enclosing all E0L-languages are of tape-complexity (log n)3. The proof indicates in what respect context-independent developmental languages are “more complex” than context-free languages, for which a tape-complexity (log n)2 is known
In this paper context-free languages are investigated according to their ordering properties. For th...
Some complexity measures which are well-known for context-free languages are generalized in order to...
The long accepted complexity invariance of human languages has become controversial within the last ...
We show that languages in the least full AFL enclosing all E0L-languages are of tape-complexity (log...
The tape complexity of context-free languages is investigated. It is shown that all the members of t...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
In this note we show that the tape bounded complexity classes of languages over single letter alpha...
Supporters of languages planned for international communication, like Esperanto, often claim that th...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
Abstract. The syntactic complexity of a regular language is the cardi-nality of its syntactic semigr...
AbstractIn this paper we show that the tape bounded complexity classes of languages over single lett...
In this paper context-free languages are investigated according to their ordering properties. For th...
Some complexity measures which are well-known for context-free languages are generalized in order to...
The long accepted complexity invariance of human languages has become controversial within the last ...
We show that languages in the least full AFL enclosing all E0L-languages are of tape-complexity (log...
The tape complexity of context-free languages is investigated. It is shown that all the members of t...
It is shown that every deterministic multitape Turing machine of time complexity t(n)/log t(n). Con...
ARSTRAcr. It is shown that every deterministic multltape Turlng machine of time complexity t(n) can ...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
In this note we show that the tape bounded complexity classes of languages over single letter alpha...
Supporters of languages planned for international communication, like Esperanto, often claim that th...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
Abstract. The syntactic complexity of a regular language is the cardi-nality of its syntactic semigr...
AbstractIn this paper we show that the tape bounded complexity classes of languages over single lett...
In this paper context-free languages are investigated according to their ordering properties. For th...
Some complexity measures which are well-known for context-free languages are generalized in order to...
The long accepted complexity invariance of human languages has become controversial within the last ...
DOI
Add to ORKG