Descriptional complexity of semi-conditional grammars

Authors:
Tomáš Masopust;Alexander Meduna
Affiliations:
Faculty of Information Technology, Brno University of Technology, Božetěchova 2, Brno 61266, Czech Republic;Faculty of Information Technology, Brno University of Technology, Božetěchova 2, Brno 61266, Czech Republic
Venue:
Information Processing Letters
Year:
2007

Citing 7
Cited 2

A variant of random context grammars: semi-conditional grammars

Theoretical Computer Science
Automata and languages: theory and applications

Automata and languages: theory and applications
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Reduction of simple semi-conditional grammars with respect to the number of conditional productions

Acta Cybernetica
Context-Free-Like Forms for the Phrase-Structure Grammars

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
On the descriptional complexity of some rewriting mechanisms regulated by context conditions

Theoretical Computer Science - Descriptional complexity of formal systems
Grammars with Context Conditions and Their Applications

Grammars with Context Conditions and Their Applications

A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A note on the descriptional complexity of semi-conditional grammars

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The descriptional complexity of semi-conditional grammars is studied. It is proved that every recursively enumerable language is generated by a semi-conditional grammar of degree (2,1) with no more than seven conditional productions and eight nonterminals.