Variations of the separating words problem

DOI10.1007/978-3-031-07469-1_13MaRDI QIDQ2164746zbMATH OpenOpenAlexFDO

Authors Nicholas Q. Tran

Publication date 16 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-07469-1_13

zbMATH Keywords

DFAlower and upper boundsseparating words

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?)
• Remarks on separating words
• Separating strings with small automata
• Separating words and trace reconstruction

Cited in

(4)

• scientific article; zbMATH DE number 5896082 (Why is no real title available?)
• ON PARTITIONS SEPARATING WORDS
• scientific article; zbMATH DE number 5507716 (Why is no real title available?)
• Separating Words from Every Start State with Horner Automata

This page was built for publication: Variations of the separating words problem

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