ON INEQUALITIES BETWEEN SUBWORD HISTORIES

DOI10.1142/S012905410800611XzbMath1155.68064MaRDI QIDQ3526551

Szilárd Zsolt Fazekas

Publication date: 25 September 2008

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

zbMATH Keywords

number of subwordsscattered subwordParikh matrix

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Subword histories and associated matrices ⋮ Absoluteness of subword inequality is undecidable ⋮ A NOTE ON THE DECIDABILITY OF SUBWORD INEQUALITIES

Cites Work

• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Subword histories and Parikh matrices
• Extending Parikh matrices
• Connections between subwords and certain matrix mappings
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY

This page was built for publication: ON INEQUALITIES BETWEEN SUBWORD HISTORIES