ON SUBWORD SYMMETRY OF WORDS

DOI10.1142/S0129054108005656zbMATH Open1155.68033OpenAlexW2114357207MaRDI QIDQ3532154FDOQ3532154

Authors: 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

Recommendations

• Overlap-free symmetric D0L words
• On symmetry in strings
• On symmetry in strings, sequences and languages
• On fairness of D0L systems
• Comparing subword occurrences in binary D0L sequences

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Overlap-free symmetric D0L words
• Generalizations of Parikh mappings
• Title not available (Why is that?)
• On symmetry in strings, sequences and languages
• A new measure of asymmetry of binary words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532154)