Elementary decompositions of arbitrary maps over finite sets

DOI10.1016/J.JSC.2003.05.001MaRDI QIDQ2643510zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• An algorithm for the formation of a hierarchical system of invariants of isomorphisms of mappings of finite sets
• Decompositions of mappings into themselves and dynamical processes associated with the mappings
• scientific article; zbMATH DE number 4027366
• Algebraic decomposition of discrete functions
• Structure and Transition-Preserving Functions of Finite Automata

Cites work

• Completeness in Finite Algebras with a Single Operation
• scientific article; zbMATH DE number 3150816 (Why is no real title available?)
• scientific article; zbMATH DE number 3231913 (Why is no real title available?)

Cited in

(10)

• Decomposing Samuelson maps
• Complete simulation of automata networks
• An algorithm for the formation of a hierarchical system of invariants of isomorphisms of mappings of finite sets
• Surjections and coverings
• Decompositions of mappings into themselves and dynamical processes associated with the mappings
• Mappings on Decomposable Combinatorial Structures: Analytic Approach
• Memoryless computation: new results, constructions, and extensions
• Almost Total Elementary Maps
• Computing in permutation groups without memory
• Computing in matrix groups without memory

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

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