Separating strings with small automata
From MaRDI portal
Publication:1116698
DOI10.1016/0020-0190(89)90215-9zbMath0666.68051OpenAlexW2060826277MaRDI QIDQ1116698
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90215-9
Related Items (13)
On the robustness of primitive words ⋮ Variations of the separating words problem ⋮ Lower bounds on words separation: are there short identities in transformation semigroups? ⋮ Separating words problem over groups ⋮ On the gap between separating words and separating their reversals ⋮ Separating Words from Every Start State with Horner Automata ⋮ On a Conjecture by Christian Choffrut ⋮ Separating words with machines and groups ⋮ Separating the Words of a Language by Counting Factors ⋮ Unnamed Item ⋮ Remarks on Separating Words ⋮ New Results on Vector and Homing Vector Automata ⋮ Looking for Pairs that Hard to Separate: A Quantum Approach
Cites Work
This page was built for publication: Separating strings with small automata
