It has been pointed out that context-free grammars of a certain class have the property that a one-one mapping exists between the structural descriptions of its sentences and the sentences generated by a finite state grammar. Given a grammar, it is decidable whether it belongs to this specific class or not.The grammars of this class can be divided into a countable hierarchy of increasing complexity
AbstractThis paper is a contribution to the theory of grammatical complexity, in particular to the f...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
It has been pointed out that context-free grammars of a certain class have the property that a one-o...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
AbstractA context-free grammar is said to be NTS if the set of sentential forms it generates is unch...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
We continue the study of finite grammatical families by characterizing when a family has a predecess...
We consider the complexity of the equivalence and containment problems for regular expressions and c...
Proceeding volume: 140Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have l...
This paper proposes a notion of finitely-verifiable classes of sentences. Informally, a class of sen...
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
Finite state translation systems (fsts') are a widely studied computational model in the area of tre...
It is proved that every grammar for a bounded, context-free language has finite index
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
AbstractThis paper is a contribution to the theory of grammatical complexity, in particular to the f...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
It has been pointed out that context-free grammars of a certain class have the property that a one-o...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
AbstractA context-free grammar is said to be NTS if the set of sentential forms it generates is unch...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
We continue the study of finite grammatical families by characterizing when a family has a predecess...
We consider the complexity of the equivalence and containment problems for regular expressions and c...
Proceeding volume: 140Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have l...
This paper proposes a notion of finitely-verifiable classes of sentences. Informally, a class of sen...
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
Finite state translation systems (fsts') are a widely studied computational model in the area of tre...
It is proved that every grammar for a bounded, context-free language has finite index
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
AbstractThis paper is a contribution to the theory of grammatical complexity, in particular to the f...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
DOI
Add to ORKG