{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/binary-intersection-formalized","title":"Binary intersection formalized","arxiv_id":"2006.16711","date":"2020-06-30","proceeding":null,"authors":["Štěpán Holub","Štěpán Starosta"],"abstract":"We provide a reformulation and a formalization of the classical result by Juhani Karhum\\\"aki characterizing intersections of two languages of the form $\\{x,y\\}^*\\cap \\{u,v\\}^*$. We use the terminology of morphisms which allows to formulate the result in a shorter and more transparent way, and we formalize the result in the proof assistant Isabelle/HOL.","url_abs":"https://arxiv.org/abs/2006.16711v1","url_pdf":"https://arxiv.org/pdf/2006.16711v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"binary-intersection-formalized","repo_url":"https://gitlab.com/formalcow/combinatorics-on-words-formalized","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}