Characterization of idempotent transformation monoids

DOI10.1016/0020-0190(89)90226-3zbMath0671.68025OpenAlexW1964726605MaRDI QIDQ1119394

Martin Beaudry

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90226-3

zbMATH Keywords

computational complexitysemigroup of automaton

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic theory of languages and automata (68Q70)

Related Items (2)

Bilateral locally testable languages. ⋮ Efficient simplicity testing of automata

Cites Work

• Unnamed Item
• Unnamed Item
• Space-bounded reducibility among combinatorial problems
• A taxonomy of problems with fast parallel algorithms
• Complexity of some problems from the theory of automata
• Testing membership: Beyond permutation groups
• All Varieties of Bands I

This page was built for publication: Characterization of idempotent transformation monoids