Deterministic concatenation product of languages recognized by finite idempotent monoids.

DOI10.1007/s00233-006-0669-3zbMath1127.20036MaRDI 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 alphabets; varieties of finite monoids; finite bases of identities; varieties of languages; concatenation products of languages; finite idempotent monoids

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20M07: Varieties and pseudovarieties of semigroups

68Q70: Algebraic theory of languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

Related Items

Theme and Variations on the Concatenation Product