DOIAbstract
AbstractTwo iteration theorems, one for strict deterministic languages of degree n, the other for simple deterministic languages, are presented. Examples demonstrating the use of these theorems are also given
AbstractTwo iteration theorems, one for strict deterministic languages of degree n, the other for simple deterministic languages, are presented. Examples demonstrating the use of these theorems are also given
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
AbstractAn infinite hierarchy of real-time deterministic context free languages is introduced. It sp...
Abstract. A computer implementation of Gödel’s algorithm for class formation in Mathematica TM was u...
Deterministic substitution of languages means substituting the same word (from a given language) for...
A procedure to resolve simple deterministic languages into the concatenation of other simple determi...
the date of receipt and acceptance should be inserted later Abstract A special kind of substitution ...
It is shown that the conditions in the iteration theorem for LL-languages are not sufficient to char...
A number of results about deterministic languages (languages accepted by pushdown automata with no c...
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework ...
In the context of abstract interpretation for languages without higher-order features we study the n...
AbstractIt is shown that the conditions in the iteration theorem for LL-languages are not sufficient...
AbstractTo approximate a common fixed point of a countable family of continuous pseudocontractive ma...
AbstractWe introduce iteration schemes for families of nonexpansive mappings in Hilbert spaces, and ...
AbstractAn infinite hierarchy of deterministic context free languages is introduced. The hierarchy i...
Abstract Using the implicit iteration and the hybrid method in mathematical programming, we prove we...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
AbstractAn infinite hierarchy of real-time deterministic context free languages is introduced. It sp...
Abstract. A computer implementation of Gödel’s algorithm for class formation in Mathematica TM was u...
Deterministic substitution of languages means substituting the same word (from a given language) for...
A procedure to resolve simple deterministic languages into the concatenation of other simple determi...
the date of receipt and acceptance should be inserted later Abstract A special kind of substitution ...
It is shown that the conditions in the iteration theorem for LL-languages are not sufficient to char...
A number of results about deterministic languages (languages accepted by pushdown automata with no c...
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework ...
In the context of abstract interpretation for languages without higher-order features we study the n...
AbstractIt is shown that the conditions in the iteration theorem for LL-languages are not sufficient...
AbstractTo approximate a common fixed point of a countable family of continuous pseudocontractive ma...
AbstractWe introduce iteration schemes for families of nonexpansive mappings in Hilbert spaces, and ...
AbstractAn infinite hierarchy of deterministic context free languages is introduced. The hierarchy i...
Abstract Using the implicit iteration and the hybrid method in mathematical programming, we prove we...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
AbstractAn infinite hierarchy of real-time deterministic context free languages is introduced. It sp...
Abstract. A computer implementation of Gödel’s algorithm for class formation in Mathematica TM was u...
Add to ORKG