THE BIDETERMINISTIC CONCATENATION PRODUCT
DOI10.1142/S0218196793000305zbMATH Open0816.20065OpenAlexW2016671679MaRDI QIDQ4285344FDOQ4285344
Authors: Jean-Éric Pin, Denis Thérien
Publication date: 17 April 1994
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196793000305
Recommendations
- Deterministic concatenation product of languages recognized by finite idempotent monoids.
- Theme and variations on the concatenation product
- Two algebraic approaches to variants of the concatenation product
- The Kernel Category and Variants of the Concatenation Product
- On the Pin-Thérien expansion of idempotent monoids
idempotentssyntactic monoidsvariety of languagesbideterministic productsexpansion of semigroupsmarked productsproduct of languages
Algebraic theory of languages and automata (68Q70) General structure theory for semigroups (20M10) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (6)
- Bases for pseudovarieties closed under bideterministic product
- Deterministic concatenation product of languages recognized by finite idempotent monoids.
- Expletive languages
- Two algebraic approaches to variants of the concatenation product
- On the Pin-Thérien expansion of idempotent monoids
- Mathematical Foundations of Computer Science 2004
This page was built for publication: THE BIDETERMINISTIC CONCATENATION PRODUCT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285344)