Binary intersection formalized

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F21%3A00349659" target="_blank" >RIV/68407700:21240/21:00349659 - isvavai.cz</a>

Alternative codes found

RIV/00216208:11320/21:10438463

Result on the web

<a href="https://doi.org/10.1016/j.tcs.2021.03.002" target="_blank" >https://doi.org/10.1016/j.tcs.2021.03.002</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2021.03.002" target="_blank" >10.1016/j.tcs.2021.03.002</a>

Result language

angličtina

Original language name

Binary intersection formalized

Original language description

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}^* 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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA20-20621S" target="_blank" >GA20-20621S: Combinatorics on words formalization</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

1879-2294

Volume of the periodical

866

Issue of the periodical within the volume

April

Country of publishing house

GB - UNITED KINGDOM

Number of pages

11

Pages from-to

14-24

UT code for WoS article

000637917600002

EID of the result in the Scopus database

2-s2.0-85103321922