Separating Words from Every Start State with Horner Automata

DOI10.4204/EPTCS.386.19MaRDI QIDQ6204139zbMATH OpenOpenAlexFDO

Authors 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

• Approximate formulas for some functions of prime numbers
• scientific article; zbMATH DE number 3956447 (Why is no real title available?)
• scientific article; zbMATH DE number 51347 (Why is no real title available?)
• Minimal DFA for testing divisibility
• Separating strings with small automata
• Separating words and trace reconstruction
• Separating words by occurrences of subwords
• Variations of the separating words problem

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

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