Counting modulo finite semigroups
From MaRDI portal
Publication:5941256
DOI10.1016/S0304-3975(00)00112-2zbMath0976.03048OpenAlexW2033578045MaRDI QIDQ5941256
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00112-2
Algebraic theory of languages and automata (68Q70) Complexity of computation (including implicit computational complexity) (03D15) Semigroups in automata theory, linguistics, etc. (20M35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work