Elementary decompositions of arbitrary maps over finite sets

DOI10.1016/j.jsc.2003.05.001zbMath1137.08300OpenAlexW2046235549MaRDI QIDQ2643510

Serge Burckel

Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2003.05.001

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70)

Related Items (4)

Memoryless computation: new results, constructions, and extensions ⋮ Complete simulation of automata networks ⋮ Computing in permutation groups without memory ⋮ Computing in matrix groups without memory

Cites Work

• Completeness in Finite Algebras with a Single Operation
• Unnamed Item
• Unnamed Item

This page was built for publication: Elementary decompositions of arbitrary maps over finite sets