Skip to main content
Conference Proceedings

Binary Intersection Revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11682 LNCS 217-225
DOI: 10.1007/978-3-030-28796-2_17
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We reformulate 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.

Cite

CITATION STYLE

APA

Holub, Š. (2019). Binary Intersection Revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11682 LNCS, pp. 217–225). Springer Verlag. https://doi.org/10.1007/978-3-030-28796-2_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free