Group-complexity and reversals of finite semigroups

DOI10.1007/BF01762671MaRDI QIDQ4106789zbMATH OpenFDO

Authors Yechezkel Zalcstein

Publication date 1975

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01762671

Mathematics Subject Classification ID

General structure theory for semigroups (20M10)

Cites work

• Algebraic decision procedures for local testability
• Characterizations of locally testable events
• Complexity of finite semigroups
• Decomposition and complexity of finite semigroups
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3195417 (Why is no real title available?)
• Locally testable languages
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups

Cited in

(2)

• Krohn-Rhodes complexity pseudovarieties are not finitely based
• COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY

This page was built for publication: Group-complexity and reversals of finite semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4106789)