Elementary decompositions of arbitrary maps over finite sets

DOI10.1016/J.JSC.2003.05.001zbMATH Open1137.08300OpenAlexW2046235549MaRDI QIDQ2643510FDOQ2643510

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

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

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Completeness in Finite Algebras with a Single Operation

Cited In (10)

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

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)