ON SUBWORD SYMMETRY OF WORDS

DOI10.1142/S0129054108005656zbMath1155.68033OpenAlexW2114357207MaRDI QIDQ3532154

Anton Černý

Publication date: 3 November 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108005656

zbMATH Keywords

D0L systemfair wordscattered subwords\(L\)-symmetric words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (1)

Generalizations of Parikh mappings

Cites Work

• Some characterizations of Parikh matrix equivalent binary words
• On a generalization of the Dyck-language over a two letter alphabet
• Subword histories and Parikh matrices
• Extending Parikh matrices
• Independence of certain quantities indicating subword occurrences
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• On Context-Free Languages

This page was built for publication: ON SUBWORD SYMMETRY OF WORDS