2000 character limit reached
Binary intersection formalized
Published 30 Jun 2020 in cs.FL and cs.AI | (2006.16711v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.