Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup

DOI10.1007/978-3-642-11266-9_55zbMath1274.68164OpenAlexW1520295138MaRDI QIDQ3401119

Wojciech Rytter, Jakub Radoszewski

Publication date: 28 January 2010

Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_55

zbMATH Keywords

finite automataefficient algorithmBurnside-type problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)

Related Items (1)

Polynomial time multiplication and normal forms in free bands

This page was built for publication: Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup