Separating Words from Every Start State with Horner Automata

DOI10.4204/eptcs.386.19arXiv2309.02766OpenAlexW4386400098MaRDI QIDQ6204139

Nicholas Q. Tran

Publication date: 9 April 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2309.02766

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Separating strings with small automata
• Minimal DFA for testing divisibility
• Variations of the separating words problem
• Approximate formulas for some functions of prime numbers
• Separating words by occurrences of subwords
• Separating words and trace reconstruction

This page was built for publication: Separating Words from Every Start State with Horner Automata