A new type of grammar for generating formal languages, called a conditional grammar is presented. A conditional grammar generates the language in a deterministic way and its operation resembles that of a program. Classes of languages generated by some subclasses of conditional grammars are investigated and related to known classes of languages
. We investigate three dierent aspects of external contextual languages, focusing mainly on linear ...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
A new type of grammar for generating formal languages, called a conditional grammar is presented. A ...
A conditional grammar is a Chomsky grammar with languages associated to its rules such that each rul...
A weakly conditional grammar is specified as a pair K = (G, G′) where G is a context-free grammar, a...
The present paper discusses the descriptional complexity of simple semiconditional grammars with res...
AbstractA semi-conditional grammar is a context-free grammar whose rules have two associated strings...
This paper simplifies semi-conditional grammars so their productions have no more than one associate...
This paper discusses some conditional versions of matrix grammars. It establishes several characteri...
AbstractWe show that each re language can be generated by a minimal deterministic linear contextfree...
AbstractWe show that each recursively enumerable language can be generated by two cooperating condit...
This paper discusses some conditional versions of matrix grammars. It establishes several characteri...
Abstract. The descriptional complexity of semi-conditional grammars is studied. A proof that every r...
This thesis involves the study of formal properties of grammatical formalisms that are relevant to c...
. We investigate three dierent aspects of external contextual languages, focusing mainly on linear ...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
A new type of grammar for generating formal languages, called a conditional grammar is presented. A ...
A conditional grammar is a Chomsky grammar with languages associated to its rules such that each rul...
A weakly conditional grammar is specified as a pair K = (G, G′) where G is a context-free grammar, a...
The present paper discusses the descriptional complexity of simple semiconditional grammars with res...
AbstractA semi-conditional grammar is a context-free grammar whose rules have two associated strings...
This paper simplifies semi-conditional grammars so their productions have no more than one associate...
This paper discusses some conditional versions of matrix grammars. It establishes several characteri...
AbstractWe show that each re language can be generated by a minimal deterministic linear contextfree...
AbstractWe show that each recursively enumerable language can be generated by two cooperating condit...
This paper discusses some conditional versions of matrix grammars. It establishes several characteri...
Abstract. The descriptional complexity of semi-conditional grammars is studied. A proof that every r...
This thesis involves the study of formal properties of grammatical formalisms that are relevant to c...
. We investigate three dierent aspects of external contextual languages, focusing mainly on linear ...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
DOI
Add to ORKG