DeepAI AI Chat

Binary intersection formalized

06/30/2020

∙

by Štěpán Holub, et al.

∙

Czech Technical University in Prague

∙

Charles University in Prague

∙

∙

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.

Štěpán Holub
3 publications
Štěpán Starosta
3 publications

page 1

page 2

page 3

page 4

∙ 12/02/2019

Proof of Dudley's Convex Approximation

We provide a self contained proof of a result of Dudley [Dud64] which sh...

0 Sariel Har-Peled, et al. ∙

∙ 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...

0 Tomoyuki Yamakami, et al. ∙

∙ 10/22/2017

Characterizing and Enumerating Walsh-Hadamard Transform Algorithms

We propose a way of characterizing the algorithms computing a Walsh-Hada...

0 François Serre, et al. ∙

∙ 02/21/2019

A complete axiomatisation of reversible Kleene lattices

We consider algebras of languages over the signature of reversible Kleen...

0 Paul Brunet, et al. ∙

∙ 01/12/2018

Forest Categories

We extend Tilson's theory of the algebra of finite categories, in partic...

0 Howard Straubing, et al. ∙

∙ 01/20/2021

One-way resynchronizability of word transducers

The origin semantics for transducers was proposed in 2014, and led to va...

0 Sougata Bose, et al. ∙

∙ 09/02/2022

Optimal General Factor Problem and Jump System Intersection

In the optimal general factor problem, given a graph G=(V, E) and a set ...

0 Yusuke Kobayashi, et al. ∙