Deterministic concatenation product of languages recognized by finite idempotent monoids.

DOI10.1007/s00233-006-0669-3zbMath1127.20036OpenAlexW2124240364MaRDI QIDQ2373421

Mário J. J. Branco

Publication date: 19 July 2007

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-006-0669-3

zbMATH Keywords

finite alphabetsvarieties of finite monoidsfinite bases of identitiesvarieties of languagesconcatenation products of languagesfinite idempotent monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Theme and Variations on the Concatenation Product ⋮ Bases for pseudovarieties closed under bideterministic product

This page was built for publication: Deterministic concatenation product of languages recognized by finite idempotent monoids.