Group-complexity and reversals of finite semigroups

DOI10.1007/BF01762671zbMath0338.20085MaRDI QIDQ4106789

Yechezkel Zalcstein

Publication date: 1975

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

Mathematics Subject Classification ID

General structure theory for semigroups (20M10)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
• Complexity of finite semigroups
• Decomposition and complexity of finite semigroups
• Locally testable languages
• Characterizations of locally testable events
• Algebraic decision procedures for local testability

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