Affiliation:
1. Faculty of Computer Science, Al.I.Cuza University, Str. General Berthelot 16, Iasi 700483, Romania
Abstract
Restricting the Parikh Matrix mapping to a language rather than to an alphabet rises a set of problems that seem interesting to us. Moreover, amiability (or M -equivalence as it is named by other authors) is exploited in order to characterise certain types of languages. The paper also proposes a series of results establishing relations between classes of languages defined by Parikh matrix mappings and the Chomsky hierarchy. Finally, a result related to word composition concludes the paper, showing that for every two arbitrary words there exist two other words such that their composition (two by two) is amiable.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Erasure and error correcting ability of Parikh matrices;Information Processing Letters;2022-04
2. A New Operator over Parikh Languages;International Journal of Foundations of Computer Science;2016-09
3. Separability of M-Equivalent Words by Morphisms;International Journal of Foundations of Computer Science;2016-01
4. Core words and Parikh matrices;Theoretical Computer Science;2015-05
5. On Core Words and the Parikh Matrix Mapping;International Journal of Foundations of Computer Science;2015-01