Binary intersection formalized

06/30/2020
by   Štěpán Holub, et al.
0

We provide a reformulation and a formalization of the classical result by Juhani Karhumäki characterizing intersections of two languages of the form {x,y}^*∩{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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2019

Proof of Dudley's Convex Approximation

We provide a self contained proof of a result of Dudley [Dud64] which sh...
research
12/17/2021

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas

We study the computational complexity of finite intersections and unions...
research
10/22/2017

Characterizing and Enumerating Walsh-Hadamard Transform Algorithms

We propose a way of characterizing the algorithms computing a Walsh-Hada...
research
02/21/2019

A complete axiomatisation of reversible Kleene lattices

We consider algebras of languages over the signature of reversible Kleen...
research
01/12/2018

Forest Categories

We extend Tilson's theory of the algebra of finite categories, in partic...
research
01/20/2021

One-way resynchronizability of word transducers

The origin semantics for transducers was proposed in 2014, and led to va...
research
12/09/2019

Revisiting zero-rate bounds on the reliability function of discrete memoryless channels

We present a new proof of Berlekamp's zero-rate upper bound on the relia...

Please sign up or login with your details

Forgot password? Click here to reset