Attractors of Parikh mapping iterations
Logic in Computer Science
2024-02-26 v1 Formal Languages and Automata Theory
Abstract
Three types of the Parikh mapping are introduced, namely, alphabetic, alphabetic-basis and basis. Explicit expressions for attractors of the k-th order in bases n >= 8, including countable ones, are found. Properties for the alphabetic, alphabetic-basis and basis Parikh vectors are given at each step of the Parikh mapping. The maximum number of iterations leading to attractors of the k-th order in the basis n is determined.
Cite
@article{arxiv.2402.14932,
title = {Attractors of Parikh mapping iterations},
author = {Alexander Chunikhin},
journal= {arXiv preprint arXiv:2402.14932},
year = {2024}
}
Comments
7 pages, 2 tables