Parikh Mapping and Iteration

Authors:
Jürgen Dassow
Affiliations:
-
Venue:
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Year:
2000

Citing 6
Cited 1

Formal languages

Formal languages
On Context-Free Languages

Journal of the ACM (JACM)
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Developmental Systems and Languages

Developmental Systems and Languages
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Optimizing evolution rules application and communication times in membrane systems implementation

WMC'07 Proceedings of the 8th international conference on Membrane computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Parikh mapping maps each word over an alphabet with n letters to an n-dimensional vector whose components give the number of occurrences of the letters in the word. We consider the Parikh images of sequences and languages obtained by iterated applications of morphisms (or sets of substitutions). Furthermore we modify the Parikh mapping such that it can be iterated and study the corresponding sequences.