Forbidding ET0L grammars

Authors:
Alexander Meduna;Martin Švec
Affiliations:
Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bozetechova 2, Brno 61266, Czech Republic;Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Bozetechova 2, Brno 61266, Czech Republic
Venue:
Theoretical Computer Science
Year:
2003

Citing 5
Cited 4

Formal languages

Formal languages
Automata and languages: theory and applications

Automata and languages: theory and applications
Handbook of Formal Languages

Handbook of Formal Languages
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Reduction of simple semi-conditional grammars with respect to the number of conditional productions

Acta Cybernetica

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

Theoretical Computer Science - Descriptional complexity of formal systems
Equivalent language models that closely simulate one another and their illustration in terms of L systems

International Journal of Computer Mathematics - Celebrating the Life of David J. Evans
Nonterminal complexity of tree controlled grammars

Theoretical Computer Science
Left Random Context ET0L Grammars

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

Abstract

The present paper introduces and discusses forbidding ET0L grammars whose productions have some attached strings, called forbidding conditions. These grammars can make a derivation step only by using productions whose forbidding conditions do not appear in the rewritten sentential form. The paper demonstrates that some well-known relationships concerning the language families resulting from ordinary ET0L grammars do not hold in terms of the forbidding ET0L grammars. Most interestingly, while E0L grammars are less powerful than ET0L grammars, their forbidding versions with conditions of length one are equally powerful. On the other hand, while EP0L grammars are as powerful as E0L grammars, FEP0L grammars are less powerful than FE0L grammars.