Reduction of simple semi-conditional grammars with respect to the number of conditional productions

Authors:
Alexander Meduna;Martin Svec
Affiliations:
-;Department of Computer Science and Engineering, Brno University of Technology, Bozetechova 2, Brno 61266, Czech Republic
Venue:
Acta Cybernetica
Year:
2002

Citing 1
Cited 5

Automata and languages: theory and applications

Automata and languages: theory and applications

Forbidding ET0L grammars

Theoretical Computer Science
On the descriptional complexity of some rewriting mechanisms regulated by context conditions

Theoretical Computer Science - Descriptional complexity of formal systems
Descriptional complexity of semi-conditional grammars

Information Processing Letters
Language classes generated by tree controlled grammars with bounded nonterminal complexity

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Language classes generated by tree controlled grammars with bounded nonterminal complexity

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The present paper discusses the descriptional complexity of simple semi-conditional grammars with respect to the number of conditional productions. More specifically, it demonstrates that for every phrase-structure grammar, there exists an equivalent simple semi-conditional grammar that has no more than twelve conditional productions.