Slender Siromoney matrix languages

Authors:
Ralf Stiebe
Affiliations:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, PF 4210, D-39016 Magdeburg, Germany
Venue:
Information and Computation
Year:
2008

Citing 9
Cited 0

Language-theoretic problems arising from Richelieu cryptosystems

Theoretical Computer Science
Picture generation using matrix systems

Journal of Information Processing and Cybernetics
On a conjecture about slender context-free languages

Theoretical Computer Science
Two-dimensional languages

Handbook of formal languages, vol. 3
Length considerations in context-free languages

Theoretical Computer Science - Special issue: formal language theory
Pattern matching in matrix grammars

Journal of Automata, Languages and Combinatorics
On lengths of words in context-free languages

Theoretical Computer Science
Formal properties of sequential/parallel matrix languages

ACM '76 Proceedings of the 1976 annual conference
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Siromoney matrix grammar is a simple device for the generation of rectangular pictures. In this paper we discuss Siromoney matrix grammars whose picture language are slender, i.e., they contain only a bounded number of pictures for each size. In particular, it is shown that the slenderness decision problem is decidable for Siromoney matrix grammars with context-free rules. Moreover, some closure and decidability questions for slender Siromoney matrix languages are discussed.