DOIAbstract
A procedure to resolve simple deterministic languages into the concatenation of other simple deterministic languages is presented
A procedure to resolve simple deterministic languages into the concatenation of other simple deterministic languages is presented
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
Let A X* be a regular language. In the paper, we will provide an algorithm to decide whether there ...
A procedure to resolve simple deterministic languages into the concatenation of other simple determi...
AbstractTwo iteration theorems, one for strict deterministic languages of degree n, the other for si...
A number of results about deterministic languages (languages accepted by pushdown automata with no c...
AbstractIt is shown that the problem whether an effectively given deterministic ω-context-free langu...
This paper provides a method of decomposing a subclass of ETOL languages into deterministic ETOL lan...
The class of deterministic indexed languages will be further investigated. A number of closure and n...
In this paper we examine the ability of different systems to generate languages in which the words ...
Deterministic substitution of languages means substituting the same word (from a given language) for...
AbstractAn infinite hierarchy of deterministic context free languages is introduced. The hierarchy i...
AbstractThis paper provides a method of “decomposing” a subclass of ET0L languages into deterministi...
The equivalence problem for deterministic context-free languages is shown to be decidable if and onl...
A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be writte...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
Let A X* be a regular language. In the paper, we will provide an algorithm to decide whether there ...
A procedure to resolve simple deterministic languages into the concatenation of other simple determi...
AbstractTwo iteration theorems, one for strict deterministic languages of degree n, the other for si...
A number of results about deterministic languages (languages accepted by pushdown automata with no c...
AbstractIt is shown that the problem whether an effectively given deterministic ω-context-free langu...
This paper provides a method of decomposing a subclass of ETOL languages into deterministic ETOL lan...
The class of deterministic indexed languages will be further investigated. A number of closure and n...
In this paper we examine the ability of different systems to generate languages in which the words ...
Deterministic substitution of languages means substituting the same word (from a given language) for...
AbstractAn infinite hierarchy of deterministic context free languages is introduced. The hierarchy i...
AbstractThis paper provides a method of “decomposing” a subclass of ET0L languages into deterministi...
The equivalence problem for deterministic context-free languages is shown to be decidable if and onl...
A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be writte...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
Let A X* be a regular language. In the paper, we will provide an algorithm to decide whether there ...
Add to ORKG