On the varieties of languages associated with some varieties of finite monoids with commuting idempotents

DOI10.1016/0890-5401(90)90024-CzbMath0699.68091MaRDI QIDQ913522

N. E. Zubov

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

finite automatonrecognizable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (7)

Strongly locally testable semigroups with commuting idempotents and related languages ⋮ Over testable languages ⋮ Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups ⋮ Counting monoids and rational languages ⋮ A formula for multiple classifiers in data mining based on Brandt semigroups ⋮ REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA ⋮ Join decompositions of pseudovarieties involving semigroups with commuting idempotents

Cites Work

• Inverse semigroups and varieties of finite semigroups
• Finite semigroup varieties of the form V*D
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the varieties of languages associated with some varieties of finite monoids with commuting idempotents