A NOTE ON THE DECIDABILITY OF SUBWORD INEQUALITIES

DOI10.1142/S0129054113500135zbMath1273.68289MaRDI QIDQ2856016

Szilárd Zsolt Fazekas, Robert Mercaş

Publication date: 23 October 2013

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

zbMATH Keywords

inequalitiesdecidabilitysuwbord history

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Absoluteness of subword inequality is undecidable
• Subword histories and Parikh matrices
• ON INEQUALITIES BETWEEN SUBWORD HISTORIES

This page was built for publication: A NOTE ON THE DECIDABILITY OF SUBWORD INEQUALITIES