Analysis of the problem of recognition of an automaton over some ring

zbMATH Open1265.68093MaRDI QIDQ4899352FDOQ4899352

Authors: V. V. Skobelev 

Publication date: 8 January 2013

Recommendations

• On the complexity of analysis of automata over a finite ring
• Analysis of automata-algebraic models
• Analysis of Resler's automaton over finite ring
• Analysis of linear automata over the ring \(\mathbb Z_{p^k}\)
• Analysis of Sprott's automaton over some finite ring

zbMATH Keywords

automataassociative-commutative ring

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cited In (10)

• Title not available (Why is that?)
• Analysis of Sprott's automaton over some finite ring
• Automaton identification in the class of Sprott's automata
• Recognizability for automata
• Analysis of automata-algebraic models
• Analysis of families of hash functions defined by automata over a finite ring
• Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\)
• Symmetrical dynamical systems over a finite ring: their properties and complexity of identification
• Analysis of Resler's automaton over finite ring
• On the complexity of analysis of automata over a finite ring

This page was built for publication: Analysis of the problem of recognition of an automaton over some ring

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