×

A new operator over Parikh languages. (English) Zbl 1351.68131

Summary: The characterization of \(M\)-equivalence for the Parikh matrices is a decade old open problem. This paper studies Parikh matrices and \(M\)-equivalence in relation to the s-shuffle operator for the binary alphabet. We also study the distance between images under the s-shuffle operator in a graph associated to the corresponding class of \(M\)-equivalent words.

MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1142/S0129054107004735 · Zbl 1123.68097 · doi:10.1142/S0129054107004735
[2] DOI: 10.1142/S0129054110007702 · Zbl 1206.68246 · doi:10.1142/S0129054110007702
[3] DOI: 10.1016/j.tcs.2007.10.022 · Zbl 1134.68027 · doi:10.1016/j.tcs.2007.10.022
[4] Atanasiu A., Fund. Inform. 49 (4) pp 289– (2002)
[5] DOI: 10.1142/S0129054110007684 · Zbl 1215.68118 · doi:10.1142/S0129054110007684
[6] Dinu L. P., Fund. Inform. 73 (3) pp 361– (2006)
[7] DOI: 10.1016/j.ipl.2004.06.011 · Zbl 1173.68550 · doi:10.1016/j.ipl.2004.06.011
[8] DOI: 10.1142/S0129054112500049 · Zbl 1254.68194 · doi:10.1142/S0129054112500049
[9] DOI: 10.1051/ita:2001131 · Zbl 1005.68092 · doi:10.1051/ita:2001131
[10] DOI: 10.1145/321356.321364 · Zbl 0154.25801 · doi:10.1145/321356.321364
[11] DOI: 10.1016/0304-3975(93)90293-3 · Zbl 0801.68106 · doi:10.1016/0304-3975(93)90293-3
[12] Salomaa A., Fund. Inform. 64 pp 391– (2005)
[13] DOI: 10.1016/j.tcs.2010.01.036 · Zbl 1192.68422 · doi:10.1016/j.tcs.2010.01.036
[14] DOI: 10.1142/S0129054109006498 · Zbl 1170.68503 · doi:10.1142/S0129054109006498
[15] Şerbnu V. N., Fund. Inform. 73 pp 265– (2006)
[16] DOI: 10.1142/s0129054115500069 · Zbl 1312.68124 · doi:10.1142/s0129054115500069
[17] DOI: 10.1016/j.tcs.2015.03.037 · Zbl 1310.68176 · doi:10.1016/j.tcs.2015.03.037
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.