Analysis of automata-algebraic models

MaRDI QIDQ5253831zbMATH OpenFDO

Authors V. G. Skobelev

Publication date 28 May 2015

zbMATH Keywords

automatacontrolled operationsfixed pointsidentificationrings

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Algebraic theory of languages and automata (68Q70)

Recommendations

• Automata on algebraic structures. Models and methods for their study
• On the complexity of analysis of automata over a finite ring
• Analysis of the problem of recognition of an automaton over some ring
• Automata on algebraic structures
• Algebraic models for discrete systems' analysis

Cited in

(11)

• On a method of analysis of generalized automata
• Algebraic approach to the analysis of automaton systems of interconnected graphs with simple links
• On the complexity of analysis of automata over a finite ring
• Algebraic models for discrete systems' analysis
• Automata on algebraic structures. Models and methods for their study
• An analysis using dP automata
• On some class of automata-algebraic models of transducers
• scientific article; zbMATH DE number 3876597 (Why is no real title available?)
• scientific article; zbMATH DE number 1203022 (Why is no real title available?)
• Analysis of the problem of recognition of an automaton over some ring
• Automaton identification in the class of Sprott's automata

This page was built for publication: Analysis of automata-algebraic models

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