On the power of permitting features in cooperating context-free array grammar systems

Authors:
K. G. Subramanian;Ibrahim Venkat;ErzséBet Csuhaj-Varjú
Affiliations:
School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia;School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia;Department of Algorithms and Applications, Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 15
Cited 0

Formal languages

Formal languages
On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
Picture languages—a survey

Languages of Design
Control mechanisms on #-context-free array grammars

Mathematical aspects of natural and formal languages
Grammars with controlled derivations

Handbook of formal languages, vol. 2
Grammar systems

Handbook of formal languages, vol. 2
Two-dimensional languages

Handbook of formal languages, vol. 3
A shrinking lemma for random forbidding context languages

Theoretical Computer Science
Picture Languages: Formal Models for Picture Recognition

Picture Languages: Formal Models for Picture Recognition
A pumping lemma for random permitting context languages

Theoretical Computer Science
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Picture Languages: From Wang Tiles to 2D Grammars

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Pure 2D picture grammars and languages

Discrete Applied Mathematics
On some classes of 2D languages and their relations

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Cooperating basic puzzle grammar systems

IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis

Quantified Score

Hi-index	0.04

Visualization

Abstract

Among many grammar models for picture description, cooperating context-free distributed array grammar systems utilize the mechanism of cooperation between component array grammars. Here, we endow these grammar systems with the feature of permitting symbols, and examine the generative capacity of the resulting permitting cooperating context-free distributed array grammar systems with certain other kinds of isometric and non-isometric array grammars. An advantage is that the number of components is reduced when this permitting feature is used in a cooperating context-free distributed array grammar system.